Recognised as Number
2,118,049,443,904
- Positive
- Even
- Composite
- Perfect square
- 13 digits
2,118,049,443,904 is an even 13-digit integer and a composite number. It has 21 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,118,049,443,904
Digit count13
Digit sum49
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
Perfect squareYes, 1,455,352²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^6 × 181,919^2
Distinct prime factors22, 181,919
Number of divisors21
Sum of divisors σ(n)4,203,027,469,087
Aliquot sum2,084,978,025,183sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,059,018,900,544integers below n that share no factor with it
Carmichael function λ(n)264,754,725,136the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,059,018,900,544
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 181,919, 363,838, 727,676, 1,455,352, 2,910,704, 5,821,408, 11,642,816, 33,094,522,561, 66,189,045,122, 132,378,090,244, 264,756,180,488, 529,512,360,976, 1,059,024,721,952, 2,118,049,443,90421 in total
Arithmetic
Previous number2,118,049,443,903
Next number2,118,049,443,905
Double4,236,098,887,808
Square4,486,133,446,822,043,642,761,216
Cube9,501,852,452,320,564,293,599,211,983,858,827,264
Square root1,455,352exact
Cube root12,842.375515813≈
Negation-2,118,049,443,904
Reciprocal4.7213251 × 10^-13≈
Representations
Decimal2,118,049,443,904
Binary1111011010010010110010101101100000100000041 bits
Octal36644545330100
Hexadecimal1ED2595B040
Base 36R10NYAF4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo trillion, one hundred and eighteen billion, forty-nine million, four hundred and forty-three thousand, nine hundred and four
Ordinaltwo trillion, one hundred and eighteen billion, forty-nine million, four hundred and forty-three thousand, nine hundred and fourth
Scientific notation2.11804944 × 10^12
Engineering notation2.118049 × 10^12
In other bases
Ternary21111111001111200221112011base 3; the most digit-efficient integer base after e: 26 digits
Quinary234200231124201104base 5; one hand: 18 digits
Septenary306011145136012base 7: 15 digits
Nonary7444044627464base 9; each digit is two ternary digits: 13 digits
Duodecimal2a25aa581994base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal42eea909f4base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal45:23:49:44:27:45:4base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1T111111101TTTTT0100TTTT011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011110101111010111010101111000001000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000011110110100100101100101011011000001000000
Bit length41 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits23within that length
Bit parityeven18 set bits, so even; not the same as the number itself being even
Highest set bitbit 40worth 1,099,511,627,776
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes601 ed 25 95 b0 40
Gray code10001101110110111010111110110100001100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000011110110100100101100101011011000001000000
One's complement1111111111111111111111100001001011011010011010100100111110111111at 64 bits, every bit flipped
Bits reversed0000001000001101101010011010010010110111100000000000000000000000at 64 bits
Rotated left by 10000000000000000000000111101101001001011001010110110000010000000at 64 bits, wrapping
Shifted left by 1111101101001001011001010110110000010000000= 4,236,098,887,808, no wrap
Shifted right by 11111011010010010110010101101100000100000= 1,059,024,721,952, discarding the low bit
These bits as a double1.04645547 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime11
Nearest square below2,118,049,443,904
Nearest square above2,118,052,354,609
Powers & multiples
2,118,049,443,904 to the power 24,486,133,446,822,043,642,761,216
2,118,049,443,904 to the power 39,501,852,452,320,564,293,599,211,983,858,827,264
2,118,049,443,904 to the power 4201253933026954298764012895290… (50 digits)
2,118,049,443,904 to the power 5426265780931233411939939787397… (62 digits)
First ten multiples2,118,049,443,904, 4,236,098,887,808, 6,354,148,331,712, 8,472,197,775,616, 10,590,247,219,520, 12,708,296,663,424, 14,826,346,107,328, 16,944,395,551,232, 19,062,444,995,136, 21,180,494,439,040
Powers of twoBetween 2^40 (1,099,511,627,776) and 2^41 (2,199,023,255,552)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1403the total stopping time
Highest value reached2,118,049,443,904
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,118,049,443,904 → 1,059,024,721,952 → 529,512,360,976 → 264,756,180,488 → 132,378,090,244 → 66,189,045,122 → 33,094,522,561 → 99,283,567,684 → 49,641,783,842 → 24,820,891,921 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage211,804,944,390,400%
2,118,049,443,904% as a decimal21,180,494,439.04
2,118,049,443,904% of 1002,118,049,443,904
2,118,049,443,904% of 1,00021,180,494,439,040
As a fraction of 1002,118,049,443,904/100
Read another way
As seconds67,116 years, 342 days and 3 hours
As bytes1.926 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 2,118,049,443,904
Nearby primes
Also reads as
2118049443904 (identifier)
- 13 characters
- Checksum valid
2118049443904 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). The check digit is valid for Luhn (cards, IMEI). A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit validmod 10 with every second digit doubled
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