Base | Representation |
---|---|
bin | 10111000101001100101000… |
… | …100111000010111011101001 |
3 | 111022102110211002012000021012 |
4 | 113011030220213002323221 |
5 | 101301134023220141400 |
6 | 555522024243553305 |
7 | 30245005526514524 |
oct | 2705145047027351 |
9 | 438373732160235 |
10 | 101512233365225 |
11 | 2a388107352961 |
12 | b47590168b835 |
13 | 4484740b60ca7 |
14 | 1b0d30b085bbb |
15 | bb0875b34d35 |
hex | 5c53289c2ee9 |
101512233365225 has 24 divisors (see below), whose sum is σ = 127947178320768. Its totient is φ = 79876674187200.
The previous prime is 101512233365171. The next prime is 101512233365227. The reversal of 101512233365225 is 522563332215101.
It is a de Polignac number, because none of the positive numbers 2k-101512233365225 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101512233365227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44735729 + ... + 46950078.
It is an arithmetic number, because the mean of its divisors is an integer number (5331132430032).
Almost surely, 2101512233365225 is an apocalyptic number.
It is an amenable number.
101512233365225 is a deficient number, since it is larger than the sum of its proper divisors (26434944955543).
101512233365225 is an equidigital number, since it uses as much as digits as its factorization.
101512233365225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91686545 (or 91686540 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 101512233365225 in words is "one hundred one trillion, five hundred twelve billion, two hundred thirty-three million, three hundred sixty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •