Nerdulator> put something in

Recognised as Number

3,407,161

  • Positive
  • Odd
  • Prime
  • 7 digits

3,407,161 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,407,161
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3,407,161
Distinct prime factors13,407,161
Number of divisors2
Sum of divisors σ(n)3,407,162
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,407,160integers below n that share no factor with it
Carmichael function λ(n)3,407,160the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,407,1612 in total

Arithmetic

Previous number3,407,160
Next number3,407,162
Double6,814,322
Cube39,552,866,902,409,714,281
Square root1,845.849668852≈irrational, shown to 9 decimal places
Cube root150.474953798≈
Negation-3,407,161
Reciprocal2.93499485 × 10^-7≈

Representations

Decimal3,407,161
Binary110011111111010011100122 bits
Octal14776471
Hexadecimal33FD39
Base 36210ZD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and seven thousand, one hundred and sixty-one
Ordinalthree million, four hundred and seven thousand, one hundred and sixty-first
Scientific notation3.407161 × 10^6
Engineering notation3.407161 × 10^6

In other bases

Ternary20102002202011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1333012121base 5; one hand: 10 digits
Septenary40650262base 7: 8 digits
Nonary6362664base 9; each digit is two ternary digits: 7 digits
Duodecimal11838a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal115hi1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:46:26:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011T010T1T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000000110101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001100111111110100111001
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes333 fd 39
Gray code1010100000001110100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100111111110100111001
64-bit0000000000000000000000000000000000000000001100111111110100111001
One's complement11111111110011000000001011000110at 32 bits, every bit flipped
Bits reversed10011100101111111100110000000000at 32 bits
Rotated left by 100000000011001111111101001110010at 32 bits, wrapping
Shifted left by 111001111111101001110010= 6,814,322, no wrap
Shifted right by 1110011111111010011100= 1,703,580, discarding the low bit
These bits as a double1.6833612 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,407,177+16
Previous prime3,407,149−12
Distance to nearest prime0, it is prime
Nearest square below3,404,025
Nearest square above3,407,716

Powers & multiples

3,407,161 to the power 211,608,746,079,921
3,407,161 to the power 339,552,866,902,409,714,281
3,407,161 to the power 4134,762,985,548,081,184,519,366,241
3,407,161 to the power 5459,159,188,602,985,836,728,188,401,051,801
First ten multiples3,407,161, 6,814,322, 10,221,483, 13,628,644, 17,035,805, 20,442,966, 23,850,127, 27,257,288, 30,664,449, 34,071,610
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1177the total stopping time
Highest value reached49,118,56014× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,407,161 → 10,221,484 → 5,110,742 → 2,555,371 → 7,666,114 → 3,833,057 → 11,499,172 → 5,749,586 → 2,874,793 → 8,624,380 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage340,716,100%
3,407,161% as a decimal34,071.61
3,407,161% of 1003,407,161
3,407,161% of 1,00034,071,610
As a fraction of 1003,407,161/100

Read another way

As bytes3.249 MiB
As a 24-bit colour#33FD39

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3407161” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.