Base | Representation |
---|---|
bin | 10011001110010111… |
… | …00111001110111000 |
3 | 222122021211202101220 |
4 | 21213023213032320 |
5 | 132114141011440 |
6 | 4424051312040 |
7 | 513523216440 |
oct | 114713471670 |
9 | 28567752356 |
10 | 10321032120 |
11 | 4416a54213 |
12 | 20005ab620 |
13 | c863703c9 |
14 | 6dca4d120 |
15 | 4061738d0 |
hex | 2672e73b8 |
10321032120 has 128 divisors (see below), whose sum is σ = 36527984640. Its totient is φ = 2282987520.
The previous prime is 10321032097. The next prime is 10321032157. The reversal of 10321032120 is 2123012301.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10321032120.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 172137 + ... + 224216.
It is an arithmetic number, because the mean of its divisors is an integer number (285374880).
Almost surely, 210321032120 is an apocalyptic number.
10321032120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10321032120 is an abundant number, since it is smaller than the sum of its proper divisors (26206952520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10321032120 is a wasteful number, since it uses less digits than its factorization.
10321032120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396405 (or 396401 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10321032120 its reverse (2123012301), we get a palindrome (12444044421).
The spelling of 10321032120 in words is "ten billion, three hundred twenty-one million, thirty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •