Recognised as Number
32,717,839,442,401
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
32,717,839,442,401 is an odd 14-digit integer and a composite number. It has 9 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value32,717,839,442,401
Digit count14
Digit sum55
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 5,719,951²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation41^2 × 139,511^2
Distinct prime factors241, 139,511
Number of divisors9
Sum of divisors σ(n)33,535,539,224,659
Aliquot sum817,699,782,258sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)31,919,614,560,400integers below n that share no factor with it
Carmichael function λ(n)3,191,961,456,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 31,919,614,560,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 41, 1,681, 139,511, 5,719,951, 234,517,991, 19,463,319,121, 797,996,083,961, 32,717,839,442,4019 in total
Arithmetic
Previous number32,717,839,442,400
Next number32,717,839,442,402
Double65,435,678,884,802
Square1,070,457,017,778,730,578,596,644,801
Cube35,023,040,837,675,899,817,230,057,241,039,295,607,201
Square root5,719,951exact
Cube root31,983.663354722≈
Negation-32,717,839,442,401
Reciprocal3.05643654 × 10^-14≈
Representations
Decimal32,717,839,442,401
Binary11101110000011011011100110010101000011110000145 bits
Octal734066714520741
Hexadecimal1DC1B732A1E1
Base 36BLID8URC1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-two trillion, seven hundred and seventeen billion, eight hundred and thirty-nine million, four hundred and forty-two thousand, four hundred and one
Ordinalthirty-two trillion, seven hundred and seventeen billion, eight hundred and thirty-nine million, four hundred and forty-two thousand, four hundred and first
Scientific notation3.27178394 × 10^13
Engineering notation32.717839 × 10^12
In other bases
Ternary11021211210110111002120121001base 3; the most digit-efficient integer base after e: 29 digits
Quinary13242022113344124101base 5; one hand: 20 digits
Septenary6614533363442041base 7: 16 digits
Nonary137753414076531base 9; each digit is two ternary digits: 15 digits
Duodecimal3804b2a292601base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal33i0g4ga601base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal11:41:15:24:38:54:0:1base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1110T0TTT10110111010TT1TT1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000101100011011001011011101111110011000100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000111011100000110110111001100101010000111100001
Bit length45 bitsto write the magnitude
Set bits23the population count, or Hamming weight
Zero bits22within that length
Bit parityodd23 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 44worth 17,592,186,044,416
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes61d c1 b7 32 a1 e1
Gray code100110010000101101100101010111111000100010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000111011100000110110111001100101010000111100001
One's complement1111111111111111111000100011111001001000110011010101111000011110at 64 bits, every bit flipped
Bits reversed1000011110000101010011001110110110000011101110000000000000000000at 64 bits
Rotated left by 10000000000000000001110111000001101101110011001010100001111000010at 64 bits, wrapping
Shifted left by 11110111000001101101110011001010100001111000010= 65,435,678,884,802, no wrap
Shifted right by 111101110000011011011100110010101000011110000= 16,358,919,721,200, discarding the low bit
These bits as a double1.61647605 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime2
Nearest square below32,717,839,442,401
Nearest square above32,717,850,882,304
Powers & multiples
32,717,839,442,401 to the power 21,070,457,017,778,730,578,596,644,801
32,717,839,442,401 to the power 3350230408376758998172300572410… (41 digits)
32,717,839,442,401 to the power 4114587822691173351402891819381… (55 digits)
32,717,839,442,401 to the power 5374906598486412377868802051493… (68 digits)
First ten multiples32,717,839,442,401, 65,435,678,884,802, 98,153,518,327,203, 130,871,357,769,604, 163,589,197,212,005, 196,307,036,654,406, 229,024,876,096,807, 261,742,715,539,208, 294,460,554,981,609, 327,178,394,424,010
Powers of twoBetween 2^44 (17,592,186,044,416) and 2^45 (35,184,372,088,832)
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1200the total stopping time
Highest value reached186,338,319,949,3125× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps32,717,839,442,401 → 98,153,518,327,204 → 49,076,759,163,602 → 24,538,379,581,801 → 73,615,138,745,404 → 36,807,569,372,702 → 18,403,784,686,351 → 55,211,354,059,054 → 27,605,677,029,527 → 82,817,031,088,582 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3.27178394 × 10^15%
32,717,839,442,401% as a decimal327,178,394,424.01
32,717,839,442,401% of 10032,717,839,442,401
32,717,839,442,401% of 1,000327,178,394,424,010
As a fraction of 10032,717,839,442,401/100
Read another way
As seconds1,036,765 years, 281 days and 1 second
As bytes29.757 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 32,717,839,442,401
Nearby primes
Also reads as
32717839442401 (identifier)
- 14 characters
- Checksum fails
32717839442401 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-14 (case/carton)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page