Recognised as Number
372,964,261,264
- Positive
- Even
- Composite
- Perfect square
- 12 digits
372,964,261,264 is an even 12-digit integer and a composite number. It has 135 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value372,964,261,264
Digit count12
Digit sum52
Digit product5,225,472
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 610,708²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 7^2 × 17^2 × 1,283^2
Distinct prime factors42, 7, 17, 1,283
Number of divisors135
Sum of divisors σ(n)893,648,783,937
Aliquot sum520,684,522,673sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)150,322,109,952integers below n that share no factor with it
Carmichael function λ(n)4,697,565,936the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 150,322,109,952
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 16, 17, 28, 34, 49, 56, 68, 98, 112, 119, 136, 196, 238, 272, 289, 392, 476, 578, 784, 833, 952, 1,156, 1,283, 1,666, 1,904, 2,023, 2,312, 2,566, 3,332, 4,046, 4,624, 5,132, 6,664, 8,092, 8,981, 10,264, 13,328, 14,161, 16,184, 17,962, 20,528, 21,811, 28,322, 32,368, 35,924, 43,622, 56,644, 62,867, 71,848, 87,244, 113,288, 125,734, 143,696, 152,677, 174,488, 226,576, 251,468, 305,354, 348,976, 370,787, 502,936, 610,708, 741,574, 1,005,872, 1,068,739, 1,221,416, 1,483,148, 1,646,089, 2,137,478, 2,442,832, 2,595,509, 2,966,296, 3,292,178, 4,274,956, 5,191,018, 5,932,592, 6,584,356, 8,549,912, 10,382,036, 11,522,623, 13,168,712, 17,099,824, 18,168,563, 20,764,072, 23,045,246, 26,337,424, 27,983,513, 36,337,126, 41,528,144, 46,090,492, 55,967,026, 72,674,252, 80,658,361, 92,180,984, 111,934,052, 145,348,504, 161,316,722, 184,361,968, 195,884,591, 223,868,104, 290,697,008, 322,633,444, 391,769,182, 447,736,208, 475,719,721, 645,266,888, 783,538,364, 951,439,442, 1,290,533,776, 1,371,192,137, 1,567,076,728, 1,902,878,884, 2,742,384,274, 3,134,153,456, 3,330,038,047, 3,805,757,768, 5,484,768,548, 6,660,076,094, 7,611,515,536, 10,969,537,096, 13,320,152,188, 21,939,074,192, 23,310,266,329, 26,640,304,376, 46,620,532,658, 53,280,608,752, 93,241,065,316, 186,482,130,632, 372,964,261,264135 in total
Arithmetic
Previous number372,964,261,263
Next number372,964,261,265
Double745,928,522,528
Half186,482,130,632
Square139,102,340,180,201,250,877,696
Cube51,880,201,545,402,384,172,448,620,254,367,744
Square root610,708exact
Cube root7,198.175085747≈
Negation-372,964,261,264
Reciprocal2.68122205 × 10^-12≈
Representations
Decimal372,964,261,264
Binary10101101101011001100110111111011001000039 bits
Octal5332631576620
Hexadecimal56D666FD90
Base 364RC5AHSG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree hundred and seventy-two billion, nine hundred and sixty-four million, two hundred and sixty-one thousand, two hundred and sixty-four
Ordinalthree hundred and seventy-two billion, nine hundred and sixty-four million, two hundred and sixty-one thousand, two hundred and sixty-fourth
Scientific notation3.72964261 × 10^11
Engineering notation372.964261 × 10^9
In other bases
Ternary1022122200112001112121221base 3; the most digit-efficient integer base after e: 25 digits
Quinary22102312322330024base 5; one hand: 17 digits
Septenary35642254625200base 7: 14 digits
Nonary1278615045557base 9; each digit is two ternary digits: 13 digits
Duodecimal60348b87414base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimaleb7b6cd34base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal7:59:38:6:23:41:4base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1100T00T01TTT01TTT0T0T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101100101011101110110000001010010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000101011011010110011001101111110110010000
Bit length39 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits17within that length
Bit parityeven22 set bits, so even; not the same as the number itself being even
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes556 d6 66 fd 90
Gray code111110110111101010101011000001101011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000101011011010110011001101111110110010000
One's complement1111111111111111111111111010100100101001100110010000001001101111at 64 bits, every bit flipped
Bits reversed0000100110111111011001100110101101101010000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001010110110101100110011011111101100100000at 64 bits, wrapping
Shifted left by 11010110110101100110011011111101100100000= 745,928,522,528, no wrap
Shifted right by 110101101101011001100110111111011001000= 186,482,130,632, discarding the low bit
These bits as a double1.84268829 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
372,964,261,264 to the power 2139,102,340,180,201,250,877,696
372,964,261,264 to the power 351,880,201,545,402,384,172,448,620,254,367,744
372,964,261,264 to the power 4193494610436084313685016256351… (47 digits)
372,964,261,264 to the power 5721665744398596509423505336360… (58 digits)
First ten multiples372,964,261,264, 745,928,522,528, 1,118,892,783,792, 1,491,857,045,056, 1,864,821,306,320, 2,237,785,567,584, 2,610,749,828,848, 2,983,714,090,112, 3,356,678,351,376, 3,729,642,612,640
Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)
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 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 4
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached372,964,261,264
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps372,964,261,264 → 186,482,130,632 → 93,241,065,316 → 46,620,532,658 → 23,310,266,329 → 69,930,798,988 → 34,965,399,494 → 17,482,699,747 → 52,448,099,242 → 26,224,049,621 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage37,296,426,126,400%
372,964,261,264% as a decimal3,729,642,612.64
372,964,261,264% of 100372,964,261,264
372,964,261,264% of 1,0003,729,642,612,640
As a fraction of 100372,964,261,264/100
Read another way
As seconds11,818 years, 191 days and 11 hours
As bytes347.35 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 372,964,261,264
Nearby primes
Also reads as
372964261264 (identifier)
- 12 characters
- Checksum fails
372964261264 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