Base | Representation |
---|---|
bin | 1000110110010011010… |
… | …0000000100000001011 |
3 | 112112101012102210222202 |
4 | 2031210310000200023 |
5 | 4442311343214012 |
6 | 153500153310415 |
7 | 13661035653356 |
oct | 2154464004013 |
9 | 475335383882 |
10 | 152015210507 |
11 | 59518694686 |
12 | 2556570540b |
13 | 11447c20c04 |
14 | 750128929d |
15 | 3e4a998cc2 |
hex | 2364d0080b |
152015210507 has 16 divisors (see below), whose sum is σ = 166504066560. Its totient is φ = 138290791392.
The previous prime is 152015210489. The next prime is 152015210521. The reversal of 152015210507 is 705012510251.
It is a cyclic number.
It is not a de Polignac number, because 152015210507 - 28 = 152015210251 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 152015210507.
It is not an unprimeable number, because it can be changed into a prime (152015210107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1558613 + ... + 1653270.
It is an arithmetic number, because the mean of its divisors is an integer number (10406504160).
Almost surely, 2152015210507 is an apocalyptic number.
152015210507 is a deficient number, since it is larger than the sum of its proper divisors (14488856053).
152015210507 is a wasteful number, since it uses less digits than its factorization.
152015210507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3212002.
The product of its (nonzero) digits is 3500, while the sum is 29.
Adding to 152015210507 its reverse (705012510251), we get a palindrome (857027720758).
The spelling of 152015210507 in words is "one hundred fifty-two billion, fifteen million, two hundred ten thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •