Base | Representation |
---|---|
bin | 1000110111001101101… |
… | …0101000000111101001 |
3 | 112120000021110100100100 |
4 | 2031303122220013221 |
5 | 4443312103342043 |
6 | 153540344500013 |
7 | 14000102322105 |
oct | 2156332500751 |
9 | 476007410310 |
10 | 152260215273 |
11 | 59633a16361 |
12 | 2561377a609 |
13 | 11486904a4a |
14 | 7525a24905 |
15 | 3e62242cd3 |
hex | 23736a81e9 |
152260215273 has 12 divisors (see below), whose sum is σ = 219967373808. Its totient is φ = 101490217080.
The previous prime is 152260215181. The next prime is 152260215287. The reversal of 152260215273 is 372512062251.
152260215273 is a `hidden beast` number, since 1 + 5 + 22 + 602 + 1 + 5 + 27 + 3 = 666.
152260215273 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 152260215273 - 225 = 152226660841 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (152260214273) 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 11 ways as a sum of consecutive naturals, for example, 1324515 + ... + 1434872.
It is an arithmetic number, because the mean of its divisors is an integer number (18330614484).
Almost surely, 2152260215273 is an apocalyptic number.
It is an amenable number.
152260215273 is a deficient number, since it is larger than the sum of its proper divisors (67707158535).
152260215273 is a wasteful number, since it uses less digits than its factorization.
152260215273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2765524 (or 2765521 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The spelling of 152260215273 in words is "one hundred fifty-two billion, two hundred sixty million, two hundred fifteen thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •