Recognised as Number
2,329,777,902,321
- Positive
- Odd
- Composite
- Perfect square
- 13 digits
2,329,777,902,321 is an odd 13-digit integer and a composite number. It has 27 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,329,777,902,321
Digit count13
Digit sum54
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, 1,526,361²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 37^2 × 13,751^2
Distinct prime factors33, 37, 13,751
Number of divisors27
Sum of divisors σ(n)3,458,896,746,123
Aliquot sum1,129,118,843,802sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,511,097,390,000integers below n that share no factor with it
Carmichael function λ(n)125,924,782,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,511,097,390,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 37, 111, 333, 1,369, 4,107, 12,321, 13,751, 41,253, 123,759, 508,787, 1,526,361, 4,579,083, 18,825,119, 56,475,357, 169,426,071, 189,090,001, 567,270,003, 1,701,810,009, 6,996,330,037, 20,988,990,111, 62,966,970,333, 258,864,211,369, 776,592,634,107, 2,329,777,902,32127 in total
Arithmetic
Previous number2,329,777,902,320
Next number2,329,777,902,322
Double4,659,555,804,642
Square5,427,865,074,143,239,017,187,041
Cube12,645,720,106,518,854,533,746,546,047,085,022,161
Square root1,526,361exact
Cube root13,256.783809585≈
Negation-2,329,777,902,321
Reciprocal4.29225464 × 10^-13≈
Representations
Decimal2,329,777,902,321
Binary10000111100111000110010101100100101111000142 bits
Octal41716145311361
Hexadecimal21E719592F1
Base 36TQA9LYI9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo trillion, three hundred and twenty-nine billion, seven hundred and seventy-seven million, nine hundred and two thousand, three hundred and twenty-one
Ordinaltwo trillion, three hundred and twenty-nine billion, seven hundred and seventy-seven million, nine hundred and two thousand, three hundred and twenty-first
Scientific notation2.3297779 × 10^12
Engineering notation2.329778 × 10^12
In other bases
Ternary22020201120020011001100100base 3; the most digit-efficient integer base after e: 26 digits
Quinary301132341120333241base 5; one hand: 18 digits
Septenary330215032265232base 7: 15 digits
Nonary8221506131310base 9; each digit is two ternary digits: 13 digits
Duodecimal317639aa4a69base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal4b02fbhfg1base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal49:56:6:48:48:25:21base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10T1T1T1TTT01T0011001100100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110001110110110111010101001011100110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000100001111001110001100101011001001011110001
Bit length42 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits21within that length
Bit parityodd21 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 41worth 2,199,023,255,552
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes602 1e 71 95 92 f1
Gray code110001000101001001010111110101101110001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000100001111001110001100101011001001011110001
One's complement1111111111111111111111011110000110001110011010100110110100001110at 64 bits, every bit flipped
Bits reversed1000111101001001101010011000111001111000010000000000000000000000at 64 bits
Rotated left by 10000000000000000000001000011110011100011001010110010010111100010at 64 bits, wrapping
Shifted left by 11000011110011100011001010110010010111100010= 4,659,555,804,642, no wrap
Shifted right by 110000111100111000110010101100100101111000= 1,164,888,951,160, discarding the low bit
These bits as a double1.15106322 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime28
Nearest square below2,329,777,902,321
Nearest square above2,329,780,955,044
Powers & multiples
2,329,777,902,321 to the power 25,427,865,074,143,239,017,187,041
2,329,777,902,321 to the power 312,645,720,106,518,854,533,746,546,047,085,022,161
2,329,777,902,321 to the power 4294617192631039895932677685546… (50 digits)
2,329,777,902,321 to the power 5686392625035646107658895958069… (62 digits)
First ten multiples2,329,777,902,321, 4,659,555,804,642, 6,989,333,706,963, 9,319,111,609,284, 11,648,889,511,605, 13,978,667,413,926, 16,308,445,316,247, 18,638,223,218,568, 20,968,001,120,889, 23,297,779,023,210
Powers of twoBetween 2^41 (2,199,023,255,552) and 2^42 (4,398,046,511,104)
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 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached6,989,333,706,9643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,329,777,902,321 → 6,989,333,706,964 → 3,494,666,853,482 → 1,747,333,426,741 → 5,242,000,280,224 → 2,621,000,140,112 → 1,310,500,070,056 → 655,250,035,028 → 327,625,017,514 → 163,812,508,757 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage232,977,790,232,100%
2,329,777,902,321% as a decimal23,297,779,023.21
2,329,777,902,321% of 1002,329,777,902,321
2,329,777,902,321% of 1,00023,297,779,023,210
As a fraction of 1002,329,777,902,321/100
Read another way
As seconds73,826 years, 75 days and 12 hours
As bytes2.119 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,329,777,902,321
Nearby primes
Also reads as
2329777902321 (identifier)
- 13 characters
- Checksum fails
2329777902321 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). 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
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 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