Base | Representation |
---|---|
bin | 10011001110010000… |
… | …00110110111001101 |
3 | 222122020010001202011 |
4 | 21213020012313031 |
5 | 132113422104401 |
6 | 4424015501221 |
7 | 513512341204 |
oct | 114710066715 |
9 | 28566101664 |
10 | 10320113101 |
11 | 44164867a1 |
12 | 2000227811 |
13 | c8610accc |
14 | 6dc89023b |
15 | 406041451 |
hex | 267206dcd |
10320113101 has 8 divisors (see below), whose sum is σ = 10681166880. Its totient is φ = 9959405232.
The previous prime is 10320113081. The next prime is 10320113107. The reversal of 10320113101 is 10131102301.
10320113101 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 10320113101 - 213 = 10320104909 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 (10320113107) 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, 25015 + ... + 145828.
It is an arithmetic number, because the mean of its divisors is an integer number (1335145860).
Almost surely, 210320113101 is an apocalyptic number.
It is an amenable number.
10320113101 is a deficient number, since it is larger than the sum of its proper divisors (361053779).
10320113101 is a wasteful number, since it uses less digits than its factorization.
10320113101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172955.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 10320113101 its reverse (10131102301), we get a palindrome (20451215402).
The spelling of 10320113101 in words is "ten billion, three hundred twenty million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •