Recognised as Number
618,112,012,401
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
618,112,012,401 is an odd 12-digit integer and a composite number. It has 81 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value618,112,012,401
Digit count12
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 786,201²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 13^2 × 19^2 × 1,061^2
Distinct prime factors43, 13, 19, 1,061
Number of divisors81
Sum of divisors σ(n)1,021,314,984,417
Aliquot sum403,202,972,016sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)360,017,161,920integers below n that share no factor with it
Carmichael function λ(n)2,500,119,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 360,017,161,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 19, 39, 57, 117, 169, 171, 247, 361, 507, 741, 1,061, 1,083, 1,521, 2,223, 3,183, 3,211, 3,249, 4,693, 9,549, 9,633, 13,793, 14,079, 20,159, 28,899, 41,379, 42,237, 60,477, 61,009, 124,137, 179,309, 181,431, 183,027, 262,067, 383,021, 537,927, 549,081, 786,201, 1,125,721, 1,149,063, 1,613,781, 2,358,603, 3,377,163, 3,406,871, 3,447,189, 4,979,273, 10,131,489, 10,220,613, 14,634,373, 14,937,819, 21,388,699, 30,661,839, 43,903,119, 44,813,457, 64,166,097, 64,730,549, 131,709,357, 190,246,849, 192,498,291, 194,191,647, 278,053,087, 406,385,281, 570,740,547, 582,574,941, 834,159,261, 1,219,155,843, 1,712,221,641, 2,502,477,783, 3,614,690,131, 3,657,467,529, 5,283,008,653, 10,844,070,393, 15,849,025,959, 32,532,211,179, 47,547,077,877, 68,679,112,489, 206,037,337,467, 618,112,012,40181 in total
Arithmetic
Previous number618,112,012,400
Next number618,112,012,402
Double1,236,224,024,802
Square382,062,459,874,413,977,784,801
Cube236,157,395,935,850,337,539,126,654,221,317,201
Square root786,201exact
Cube root8,518.354856967≈
Negation-618,112,012,401
Reciprocal1.61782975 × 10^-12≈
Representations
Decimal618,112,012,401
Binary100011111110101001011000110100000111000140 bits
Octal10775226150161
Hexadecimal8FEA58D071
Base 367VYFXL69
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix hundred and eighteen billion, one hundred and twelve million, twelve thousand, four hundred and one
Ordinalsix hundred and eighteen billion, one hundred and twelve million, twelve thousand, four hundred and first
Scientific notation6.18112012 × 10^11
Engineering notation618.112012 × 10^9
In other bases
Ternary2012002110021210121122100base 3; the most digit-efficient integer base after e: 25 digits
Quinary40111343133344101base 5; one hand: 17 digits
Septenary62441251262622base 7: 14 digits
Nonary2162407717570base 9; each digit is two ternary digits: 13 digits
Duodecimal9b964566a69base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal142i001b01base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal13:14:53:49:41:13:21base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1T1TT01T11010TT11T0TT0T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000000111111101010011101000110110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001000111111101010010110001101000001110001
Bit length40 bitsto write the magnitude
Set bits20the population count, or Hamming weight
Zero bits20within that length
Bit parityeven20 set bits, so even; not the same as the number itself being odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes58f ea 58 d0 71
Gray code1100100000011111011101001011100001001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001000111111101010010110001101000001110001
One's complement1111111111111111111111110111000000010101101001110010111110001110at 64 bits, every bit flipped
Bits reversed1000111000001011000110100101011111110001000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010001111111010100101100011010000011100010at 64 bits, wrapping
Shifted left by 110001111111010100101100011010000011100010= 1,236,224,024,802, no wrap
Shifted right by 1100011111110101001011000110100000111000= 309,056,006,200, discarding the low bit
These bits as a double3.05387911 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
618,112,012,401 to the power 2382,062,459,874,413,977,784,801
618,112,012,401 to the power 3236,157,395,935,850,337,539,126,654,221,317,201
618,112,012,401 to the power 4145971723245288190837464690316… (48 digits)
618,112,012,401 to the power 5902268756087869141797458292364… (59 digits)
First ten multiples618,112,012,401, 1,236,224,024,802, 1,854,336,037,203, 2,472,448,049,604, 3,090,560,062,005, 3,708,672,074,406, 4,326,784,086,807, 4,944,896,099,208, 5,563,008,111,609, 6,181,120,124,010
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1285the total stopping time
Highest value reached1,854,336,037,2043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps618,112,012,401 → 1,854,336,037,204 → 927,168,018,602 → 463,584,009,301 → 1,390,752,027,904 → 695,376,013,952 → 347,688,006,976 → 173,844,003,488 → 86,922,001,744 → 43,461,000,872 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage61,811,201,240,100%
618,112,012,401% as a decimal6,181,120,124.01
618,112,012,401% of 100618,112,012,401
618,112,012,401% of 1,0006,181,120,124,010
As a fraction of 100618,112,012,401/100
Read another way
As seconds19,586 years, 287 days and 17 hours
As bytes575.662 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 618,112,012,401
Nearby primes
Also reads as
618112012401 (identifier)
- 12 characters
- Checksum fails
618112012401 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). 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-12 (UPC-A)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