Base | Representation |
---|---|
bin | 1000110100011011011… |
… | …0010100011100101101 |
3 | 112111002011111110211120 |
4 | 2031012312110130231 |
5 | 4440244200000023 |
6 | 153334234411153 |
7 | 13642423000200 |
oct | 2150666243455 |
9 | 474064443746 |
10 | 151512500013 |
11 | 5928a946866 |
12 | 25445290ab9 |
13 | 11397a2a194 |
14 | 74945c9937 |
15 | 3e1b7978e3 |
hex | 2346d9472d |
151512500013 has 48 divisors (see below), whose sum is σ = 238533672960. Its totient is φ = 85281487200.
The previous prime is 151512499991. The next prime is 151512500039. The reversal of 151512500013 is 310005215151.
151512500013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 151512500013 - 212 = 151512495917 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 (151512500213) 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 47 ways as a sum of consecutive naturals, for example, 4990068 + ... + 5020338.
It is an arithmetic number, because the mean of its divisors is an integer number (4969451520).
Almost surely, 2151512500013 is an apocalyptic number.
It is an amenable number.
151512500013 is a deficient number, since it is larger than the sum of its proper divisors (87021172947).
151512500013 is a wasteful number, since it uses less digits than its factorization.
151512500013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30798 (or 30791 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 151512500013 its reverse (310005215151), we get a palindrome (461517715164).
The spelling of 151512500013 in words is "one hundred fifty-one billion, five hundred twelve million, five hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •