Base | Representation |
---|---|
bin | 1001001011001000100… |
… | …01110110000010101101 |
3 | 1010010121212122201110120 |
4 | 10211210101312002231 |
5 | 20131030020341023 |
6 | 400450251355153 |
7 | 31526215252056 |
oct | 4454421660255 |
9 | 1103555581416 |
10 | 315215012013 |
11 | 111755724aa0 |
12 | 51110a52ab9 |
13 | 23956089bb5 |
14 | 11383b3572d |
15 | 82ed2e58e3 |
hex | 49644760ad |
315215012013 has 64 divisors (see below), whose sum is σ = 476451811584. Its totient is φ = 183686400000.
The previous prime is 315215012011. The next prime is 315215012023. The reversal of 315215012013 is 310210512513.
It is not a de Polignac number, because 315215012013 - 21 = 315215012011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315215012011) 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 63 ways as a sum of consecutive naturals, for example, 74113795 + ... + 74118047.
It is an arithmetic number, because the mean of its divisors is an integer number (7444559556).
Almost surely, 2315215012013 is an apocalyptic number.
315215012013 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
315215012013 is a deficient number, since it is larger than the sum of its proper divisors (161236799571).
315215012013 is a wasteful number, since it uses less digits than its factorization.
315215012013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5006.
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 315215012013 its reverse (310210512513), we get a palindrome (625425524526).
The spelling of 315215012013 in words is "three hundred fifteen billion, two hundred fifteen million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •