Recognised as Number
364,365,990,482
- Positive
- Even
- Composite
- 12 digits
364,365,990,482 is an even 12-digit integer and a composite number. It has 18 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value364,365,990,482
Digit count12
Digit sum59
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 13^2 × 32,833^2
Distinct prime factors32, 13, 32,833
Number of divisors18
Sum of divisors σ(n)591,843,258,927
Aliquot sum227,477,268,445sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)168,163,796,736integers below n that share no factor with it
Carmichael function λ(n)14,013,649,728the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 168,163,796,736
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 13, 26, 169, 338, 32,833, 65,666, 426,829, 853,658, 5,548,777, 11,097,554, 1,078,005,889, 2,156,011,778, 14,014,076,557, 28,028,153,114, 182,182,995,241, 364,365,990,48218 in total
Arithmetic
Previous number364,365,990,481
Next number364,365,990,483
Double728,731,980,964
Half182,182,995,241
Square132,762,575,019,928,914,592,324
Cube48,374,167,146,077,229,854,663,317,494,260,168
Square root603,627.360614146≈irrational, shown to 9 decimal places
Cube root7,142.429207416≈
Negation-364,365,990,482
Reciprocal2.74449325 × 10^-12≈
Representations
Decimal364,365,990,482
Binary10101001101010111100111110010100101001039 bits
Octal5232571745122
Hexadecimal54D5E7CA52
Base 364NDY3PLE
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree hundred and sixty-four billion, three hundred and sixty-five million, nine hundred and ninety thousand, four hundred and eighty-two
Ordinalthree hundred and sixty-four billion, three hundred and sixty-five million, nine hundred and ninety thousand, four hundred and eighty-second
Scientific notation3.6436599 × 10^11
Engineering notation364.36599 × 10^9
In other bases
Ternary1021211111021220010111112base 3; the most digit-efficient integer base after e: 25 digits
Quinary21432210143143412base 5; one hand: 17 digits
Septenary35216220550304base 7: 14 digits
Nonary1254437803445base 9; each digit is two ternary digits: 13 digits
Duodecimal5a749524242base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimale4d478g42base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal7:48:34:39:35:8:2base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary110TT1111110T0T0011TTTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010100101010001110001101111001010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000101010011010101111001111100101001010010
Bit length39 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits18within that length
Bit parityodd21 set bits, so odd; not the same as the number itself being even
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes554 d5 e7 ca 52
Gray code111111010111111000101000010111101111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000101010011010101111001111100101001010010
One's complement1111111111111111111111111010101100101010000110000011010110101101at 64 bits, every bit flipped
Bits reversed0100101001010011111001111010101100101010000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001010100110101011110011111001010010100100at 64 bits, wrapping
Shifted left by 11010100110101011110011111001010010100100= 728,731,980,964, no wrap
Shifted right by 110101001101010111100111110010100101001= 182,182,995,241, discarding the low bit
These bits as a double1.80020718 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
364,365,990,482 to the power 2132,762,575,019,928,914,592,324
364,365,990,482 to the power 348,374,167,146,077,229,854,663,317,494,260,168
364,365,990,482 to the power 4176259013259222530368611805854… (47 digits)
364,365,990,482 to the power 5642227899475765882990095652034… (58 digits)
First ten multiples364,365,990,482, 728,731,980,964, 1,093,097,971,446, 1,457,463,961,928, 1,821,829,952,410, 2,186,195,942,892, 2,550,561,933,374, 2,914,927,923,856, 3,279,293,914,338, 3,643,659,904,820
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 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 5
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 82
Collatz (3n + 1) trajectory
Steps to reach 1323the total stopping time
Highest value reached2,075,178,180,1845× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps364,365,990,482 → 182,182,995,241 → 546,548,985,724 → 273,274,492,862 → 136,637,246,431 → 409,911,739,294 → 204,955,869,647 → 614,867,608,942 → 307,433,804,471 → 922,301,413,414 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage36,436,599,048,200%
364,365,990,482% as a decimal3,643,659,904.82
364,365,990,482% of 100364,365,990,482
364,365,990,482% of 1,0003,643,659,904,820
As a fraction of 100364,365,990,482/100
Read another way
As seconds11,546 years, 22 days and 11 hours
As bytes339.342 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 364,365,990,482
Nearby primes
Also reads as
364365990482 (identifier)
- 12 characters
- Checksum fails
364365990482 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