Base | Representation |
---|---|
bin | 10011001110010000… |
… | …00011101111001101 |
3 | 222122020002102012002 |
4 | 21213020003233031 |
5 | 132113421202201 |
6 | 4424015322045 |
7 | 513512255660 |
oct | 114710035715 |
9 | 28566072162 |
10 | 10320100301 |
11 | 4416478115 |
12 | 2000220325 |
13 | c86105234 |
14 | 6dc8896d7 |
15 | 40603c76b |
hex | 267203bcd |
10320100301 has 8 divisors (see below), whose sum is σ = 11955968064. Its totient is φ = 8724624480.
The previous prime is 10320100261. The next prime is 10320100303. The reversal of 10320100301 is 10300102301.
10320100301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10320100301 - 222 = 10315905997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10320100303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10097435 + ... + 10098456.
It is an arithmetic number, because the mean of its divisors is an integer number (1494496008).
Almost surely, 210320100301 is an apocalyptic number.
It is an amenable number.
10320100301 is a deficient number, since it is larger than the sum of its proper divisors (1635867763).
10320100301 is an equidigital number, since it uses as much as digits as its factorization.
10320100301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20195971.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 10320100301 its reverse (10300102301), we get a palindrome (20620202602).
The spelling of 10320100301 in words is "ten billion, three hundred twenty million, one hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •