Recognised as Number
3,168,401
- Positive
- Odd
- Composite
- 7 digits
3,168,401 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,168,401
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation61 × 51,941
Distinct prime factors261, 51,941
Number of divisors4
Sum of divisors σ(n)3,220,404
Aliquot sum52,003sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,116,400integers below n that share no factor with it
Carmichael function λ(n)155,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,116,400
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 61, 51,941, 3,168,4014 in total
Arithmetic
Previous number3,168,400
Next number3,168,402
Double6,336,802
Half1,584,200.5
Square10,038,764,896,801
Cube31,806,832,737,789,185,201
Square root1,780.000280899≈irrational, shown to 9 decimal places
Cube root146.874605763≈
Negation-3,168,401
Reciprocal3.15616615 × 10^-7≈
Representations
Decimal3,168,401
Binary110000010110001001000122 bits
Octal14054221
Hexadecimal305891
Base 361VWR5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and sixty-eight thousand, four hundred and one
Ordinalthree million, one hundred and sixty-eight thousand, four hundred and first
Scientific notation3.168401 × 10^6
Engineering notation3.168401 × 10^6
In other bases
Ternary12221222020012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1302342101base 5; one hand: 10 digits
Septenary35634215base 7: 8 digits
Nonary5858205base 9; each digit is two ternary digits: 7 digits
Duodecimal1089695base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljg101base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:40:6:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T00T1T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100011010100110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100000101100010010001
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; 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
Bytes330 58 91
Gray code1010000111010011011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100000101100010010001
64-bit0000000000000000000000000000000000000000001100000101100010010001
One's complement11111111110011111010011101101110at 32 bits, every bit flipped
Bits reversed10001001000110100000110000000000at 32 bits
Rotated left by 100000000011000001011000100100010at 32 bits, wrapping
Shifted left by 111000001011000100100010= 6,336,802, no wrap
Shifted right by 1110000010110001001000= 1,584,200, discarding the low bit
These bits as a double1.56539809 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,168,401 to the power 210,038,764,896,801
3,168,401 to the power 331,806,832,737,789,185,201
3,168,401 to the power 4100,776,800,653,243,992,180,033,601
3,168,401 to the power 5319,301,315,966,538,918,067,210,641,442,001
First ten multiples3,168,401, 6,336,802, 9,505,203, 12,673,604, 15,842,005, 19,010,406, 22,178,807, 25,347,208, 28,515,609, 31,684,010
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached9,505,2043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,168,401 → 9,505,204 → 4,752,602 → 2,376,301 → 7,128,904 → 3,564,452 → 1,782,226 → 891,113 → 2,673,340 → 1,336,670 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage316,840,100%
3,168,401% as a decimal31,684.01
3,168,401% of 1003,168,401
3,168,401% of 1,00031,684,010
As a fraction of 1003,168,401/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,168,401
Nerdulate something else
Nothing in mind? Surprise me · today’s page