Base | Representation |
---|---|
bin | 1000110111001100101… |
… | …0111110000110111101 |
3 | 112112222222201211101121 |
4 | 2031303022332012331 |
5 | 4443310031023122 |
6 | 153540120510541 |
7 | 14000022406312 |
oct | 2156312760675 |
9 | 475888654347 |
10 | 152256111037 |
11 | 59631672828 |
12 | 2561231b451 |
13 | 11485ac88c4 |
14 | 7525276d09 |
15 | 3e61bd1bc7 |
hex | 23732be1bd |
152256111037 has 2 divisors, whose sum is σ = 152256111038. Its totient is φ = 152256111036.
The previous prime is 152256111019. The next prime is 152256111067. The reversal of 152256111037 is 730111652251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128684343076 + 23571767961 = 358726^2 + 153531^2 .
It is a cyclic number.
It is not a de Polignac number, because 152256111037 - 227 = 152121893309 is a prime.
It is a super-2 number, since 2×1522561110372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 152256110993 and 152256111011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152256111067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76128055518 + 76128055519.
It is an arithmetic number, because the mean of its divisors is an integer number (76128055519).
Almost surely, 2152256111037 is an apocalyptic number.
It is an amenable number.
152256111037 is a deficient number, since it is larger than the sum of its proper divisors (1).
152256111037 is an equidigital number, since it uses as much as digits as its factorization.
152256111037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12600, while the sum is 34.
Adding to 152256111037 its reverse (730111652251), we get a palindrome (882367763288).
The spelling of 152256111037 in words is "one hundred fifty-two billion, two hundred fifty-six million, one hundred eleven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •