Base | Representation |
---|---|
bin | 10011001101101001… |
… | …01010001101100101 |
3 | 222121212112001111002 |
4 | 21212310222031211 |
5 | 132111120440023 |
6 | 4423314323045 |
7 | 513421116032 |
oct | 114664521545 |
9 | 28555461432 |
10 | 10315015013 |
11 | 44136144a6 |
12 | 1bba589485 |
13 | c850446a4 |
14 | 6dbd24389 |
15 | 405885b28 |
hex | 266d2a365 |
10315015013 has 16 divisors (see below), whose sum is σ = 11513689920. Its totient is φ = 9183626496.
The previous prime is 10315014991. The next prime is 10315015021. The reversal of 10315015013 is 31051051301.
10315015013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10315015013 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10315015313) 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 15 ways as a sum of consecutive naturals, for example, 197231 + ... + 243987.
It is an arithmetic number, because the mean of its divisors is an integer number (719605620).
Almost surely, 210315015013 is an apocalyptic number.
It is an amenable number.
10315015013 is a deficient number, since it is larger than the sum of its proper divisors (1198674907).
10315015013 is a wasteful number, since it uses less digits than its factorization.
10315015013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47476.
The product of its (nonzero) digits is 225, while the sum is 20.
Adding to 10315015013 its reverse (31051051301), we get a palindrome (41366066314).
The spelling of 10315015013 in words is "ten billion, three hundred fifteen million, fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •