Base | Representation |
---|---|
bin | 100010110100000111011110… |
… | …100000001010111000000100 |
3 | 202002010122122011010200022200 |
4 | 202310013132200022320010 |
5 | 130032114031130011322 |
6 | 1301352023050354500 |
7 | 44152123661623611 |
oct | 4264073640127004 |
9 | 662118564120280 |
10 | 153115022110212 |
11 | 4487279730a858 |
12 | 1520a87312ba30 |
13 | 67588b9196356 |
14 | 29b4b414b1508 |
15 | 12a7d16add8ac |
hex | 8b41de80ae04 |
153115022110212 has 72 divisors (see below), whose sum is σ = 403539636864000. Its totient is φ = 48890378996928.
The previous prime is 153115022110207. The next prime is 153115022110231. The reversal of 153115022110212 is 212011220511351.
153115022110212 is a `hidden beast` number, since 1 + 5 + 31 + 1 + 502 + 2 + 110 + 2 + 12 = 666.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 577276462 + ... + 577541637.
Almost surely, 2153115022110212 is an apocalyptic number.
153115022110212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
153115022110212 is an abundant number, since it is smaller than the sum of its proper divisors (250424614753788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153115022110212 is a wasteful number, since it uses less digits than its factorization.
153115022110212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1154818265 (or 1154818260 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 27.
Adding to 153115022110212 its reverse (212011220511351), we get a palindrome (365126242621563).
The spelling of 153115022110212 in words is "one hundred fifty-three trillion, one hundred fifteen billion, twenty-two million, one hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •