Base | Representation |
---|---|
bin | 1000110010111100001… |
… | …0010110011000110111 |
3 | 112110001022202210112102 |
4 | 2030233002112120313 |
5 | 4433434412004003 |
6 | 153230444012315 |
7 | 13626502211453 |
oct | 2145702263067 |
9 | 473038683472 |
10 | 151113000503 |
11 | 590a5392983 |
12 | 2535353109b |
13 | 1133303263a |
14 | 7457515663 |
15 | 3de6682588 |
hex | 232f096637 |
151113000503 has 2 divisors, whose sum is σ = 151113000504. Its totient is φ = 151113000502.
The previous prime is 151113000473. The next prime is 151113000569. The reversal of 151113000503 is 305000311151.
151113000503 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (305000311151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 151113000503 - 230 = 150039258679 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151113000403) 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 as a sum of consecutive naturals, namely, 75556500251 + 75556500252.
It is an arithmetic number, because the mean of its divisors is an integer number (75556500252).
Almost surely, 2151113000503 is an apocalyptic number.
151113000503 is a deficient number, since it is larger than the sum of its proper divisors (1).
151113000503 is an equidigital number, since it uses as much as digits as its factorization.
151113000503 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 225, while the sum is 20.
Adding to 151113000503 its reverse (305000311151), we get a palindrome (456113311654).
The spelling of 151113000503 in words is "one hundred fifty-one billion, one hundred thirteen million, five hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •