Recognised as Number
61,332,376,587,001
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
61,332,376,587,001 is an odd 14-digit integer and a composite number. It has 27 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value61,332,376,587,001
Digit count14
Digit sum52
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 7,831,499²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13^2 × 31^2 × 19,433^2
Distinct prime factors313, 31, 19,433
Number of divisors27
Sum of divisors σ(n)68,628,165,266,637
Aliquot sum7,295,788,679,636sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)54,785,407,884,480integers below n that share no factor with it
Carmichael function λ(n)2,282,725,328,520the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 54,785,407,884,480
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 13, 31, 169, 403, 961, 5,239, 12,493, 19,433, 162,409, 252,629, 602,423, 3,284,177, 7,831,499, 18,675,113, 101,809,487, 242,776,469, 377,641,489, 3,156,094,097, 4,909,339,357, 11,706,886,159, 63,821,411,641, 152,189,520,067, 362,913,470,929, 1,978,463,760,871, 4,717,875,122,077, 61,332,376,587,00127 in total
Arithmetic
Previous number61,332,376,587,000
Next number61,332,376,587,002
Double122,664,753,174,002
Square3,761,660,417,809,708,433,322,174,001
Cube230,711,573,337,520,560,997,603,165,035,305,836,761,001
Square root7,831,499exact
Cube root39,436.339605075≈
Negation-61,332,376,587,001
Reciprocal1.63046022 × 10^-14≈
Representations
Decimal61,332,376,587,001
Binary110111110010000000111010000101000010101111100146 bits
Octal1574401641205371
Hexadecimal37C80E850AF9
Base 36LQNPDGQGP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-one trillion, three hundred and thirty-two billion, three hundred and seventy-six million, five hundred and eighty-seven thousand and one
Ordinalsixty-one trillion, three hundred and thirty-two billion, three hundred and seventy-six million, five hundred and eighty-seven thousand and first
Scientific notation6.13323766 × 10^13
Engineering notation61.332377 × 10^12
In other bases
Ternary22001011022120210000000001021base 3; the most digit-efficient integer base after e: 29 digits
Quinary31014332201401241001base 5; one hand: 20 digits
Septenary15630055316160052base 7: 17 digits
Nonary261138523000037base 9; each digit is two ternary digits: 15 digits
Duodecimal6a667609a7a21base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal5jffi7dd7a1base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal21:54:33:56:27:54:10:1base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary10T001011100TT1T100000000011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010001101100000010011100001010001111100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000001101111100100000001110100001010000101011111001
Bit length46 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits24within that length
Bit parityeven22 set bits, so even; not the same as the number itself being odd
Highest set bitbit 45worth 35,184,372,088,832
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes637 c8 0e 85 0a f9
Gray code1011000010110000001001110001111000111110000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000001101111100100000001110100001010000101011111001
One's complement1111111111111111110010000011011111110001011110101111010100000110at 64 bits, every bit flipped
Bits reversed1001111101010000101000010111000000010011111011000000000000000000at 64 bits
Rotated left by 10000000000000000011011111001000000011101000010100001010111110010at 64 bits, wrapping
Shifted left by 111011111001000000011101000010100001010111110010= 122,664,753,174,002, no wrap
Shifted right by 1110111110010000000111010000101000010101111100= 30,666,188,293,500, discarding the low bit
These bits as a double3.03022202 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime16
Nearest square below61,332,376,587,001
Nearest square above61,332,392,250,000
Powers & multiples
61,332,376,587,001 to the power 23,761,660,417,809,708,433,322,174,001
61,332,376,587,001 to the power 3230711573337520560997603165035… (42 digits)
61,332,376,587,001 to the power 4141500890989163102155338392428… (56 digits)
61,332,376,587,001 to the power 5867858593354352781824735481997… (69 digits)
First ten multiples61,332,376,587,001, 122,664,753,174,002, 183,997,129,761,003, 245,329,506,348,004, 306,661,882,935,005, 367,994,259,522,006, 429,326,636,109,007, 490,659,012,696,008, 551,991,389,283,009, 613,323,765,870,010
Powers of twoBetween 2^45 (35,184,372,088,832) and 2^46 (70,368,744,177,664)
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 7
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 1532the total stopping time
Highest value reached298,748,874,049,4324× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps61,332,376,587,001 → 183,997,129,761,004 → 91,998,564,880,502 → 45,999,282,440,251 → 137,997,847,320,754 → 68,998,923,660,377 → 206,996,770,981,132 → 103,498,385,490,566 → 51,749,192,745,283 → 155,247,578,235,850 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6.13323766 × 10^15%
61,332,376,587,001% as a decimal613,323,765,870.01
61,332,376,587,001% of 10061,332,376,587,001
61,332,376,587,001% of 1,000613,323,765,870,010
As a fraction of 10061,332,376,587,001/100
Read another way
As seconds1,943,505 years, 268 days and 12 hours
As bytes55.781 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 61,332,376,587,001
Nearby primes
Also reads as
61332376587001 (identifier)
- 14 characters
- Checksum fails
61332376587001 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