Base | Representation |
---|---|
bin | 1001011000101101011100… |
… | …0110110011111101001000 |
3 | 1100112121000221010001102211 |
4 | 2112023113012303331020 |
5 | 2323041101301111404 |
6 | 33540555310434504 |
7 | 2113414126310212 |
oct | 226132706637510 |
9 | 40477027101384 |
10 | 10320120332104 |
11 | 3319813978660 |
12 | 11a8137502a34 |
13 | 59b24c573b8b |
14 | 2796d451b5b2 |
15 | 12d6b3bdbb04 |
hex | 962d71b3f48 |
10320120332104 has 32 divisors (see below), whose sum is σ = 21120607715040. Its totient is φ = 4688459193600.
The previous prime is 10320120332101. The next prime is 10320120332173. The reversal of 10320120332104 is 40123302102301.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (10320120332101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31141662 + ... + 31471309.
It is an arithmetic number, because the mean of its divisors is an integer number (660018991095).
Almost surely, 210320120332104 is an apocalyptic number.
It is an amenable number.
10320120332104 is an abundant number, since it is smaller than the sum of its proper divisors (10800487382936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10320120332104 is a wasteful number, since it uses less digits than its factorization.
10320120332104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62614861 (or 62614857 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10320120332104 its reverse (40123302102301), we get a palindrome (50443422434405).
The spelling of 10320120332104 in words is "ten trillion, three hundred twenty billion, one hundred twenty million, three hundred thirty-two thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •