Base | Representation |
---|---|
bin | 1000110011000111001… |
… | …0101011111011100011 |
3 | 112110011112202022002221 |
4 | 2030301302223323203 |
5 | 4434033230213313 |
6 | 153235214451511 |
7 | 13630603136065 |
oct | 2146162537343 |
9 | 473145668087 |
10 | 151159226083 |
11 | 59119495938 |
12 | 25366b03b97 |
13 | 1133c798a58 |
14 | 745d709735 |
15 | 3dea763c8d |
hex | 2331cabee3 |
151159226083 has 2 divisors, whose sum is σ = 151159226084. Its totient is φ = 151159226082.
The previous prime is 151159226051. The next prime is 151159226087. The reversal of 151159226083 is 380622951151.
It is a strong prime.
It is an emirp because it is prime and its reverse (380622951151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 151159226083 - 25 = 151159226051 is a prime.
It is a super-2 number, since 2×1511592260832 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (151159226087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75579613041 + 75579613042.
It is an arithmetic number, because the mean of its divisors is an integer number (75579613042).
Almost surely, 2151159226083 is an apocalyptic number.
151159226083 is a deficient number, since it is larger than the sum of its proper divisors (1).
151159226083 is an equidigital number, since it uses as much as digits as its factorization.
151159226083 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 43.
The spelling of 151159226083 in words is "one hundred fifty-one billion, one hundred fifty-nine million, two hundred twenty-six thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •