Base | Representation |
---|---|
bin | 10011100101010001… |
… | …01011001110011111 |
3 | 1000010200102220012221 |
4 | 21302220223032133 |
5 | 133012334400111 |
6 | 4455114210211 |
7 | 521345503645 |
oct | 116250531637 |
9 | 30120386187 |
10 | 10513200031 |
11 | 4505477874 |
12 | 2054a23967 |
13 | cb7114829 |
14 | 71a393195 |
15 | 417e82371 |
hex | 272a2b39f |
10513200031 has 8 divisors (see below), whose sum is σ = 10876892400. Its totient is φ = 10149585600.
The previous prime is 10513200013. The next prime is 10513200037. The reversal of 10513200031 is 13000231501.
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 10513200031 - 29 = 10513199519 is a prime.
It is a super-2 number, since 2×105132000312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10513199978 and 10513200014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10513200037) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 434860 + ... + 458398.
It is an arithmetic number, because the mean of its divisors is an integer number (1359611550).
Almost surely, 210513200031 is an apocalyptic number.
10513200031 is a deficient number, since it is larger than the sum of its proper divisors (363692369).
10513200031 is a wasteful number, since it uses less digits than its factorization.
10513200031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38969.
The product of its (nonzero) digits is 90, while the sum is 16.
Adding to 10513200031 its reverse (13000231501), we get a palindrome (23513431532).
The spelling of 10513200031 in words is "ten billion, five hundred thirteen million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •