Base | Representation |
---|---|
bin | 1010001111110010000110… |
… | …00010101101110010100111 |
3 | 2221210002101021200211120001 |
4 | 11013321003002231302213 |
5 | 10423133101421021020 |
6 | 115531144231522131 |
7 | 4513630634144155 |
oct | 507710302556247 |
9 | 87702337624501 |
10 | 22532523220135 |
11 | 71a7a97a32a45 |
12 | 263ab54529347 |
13 | c75a66a2a416 |
14 | 57c8195123d5 |
15 | 2911c8d8650a |
hex | 147e430adca7 |
22532523220135 has 32 divisors (see below), whose sum is σ = 28239116716800. Its totient is φ = 17237982988800.
The previous prime is 22532523220133. The next prime is 22532523220147. The reversal of 22532523220135 is 53102232523522.
It is not a de Polignac number, because 22532523220135 - 21 = 22532523220133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22532523220094 and 22532523220103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22532523220133) 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 31 ways as a sum of consecutive naturals, for example, 40134610 + ... + 40692160.
It is an arithmetic number, because the mean of its divisors is an integer number (882472397400).
Almost surely, 222532523220135 is an apocalyptic number.
22532523220135 is a deficient number, since it is larger than the sum of its proper divisors (5706593496665).
22532523220135 is a wasteful number, since it uses less digits than its factorization.
22532523220135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560251.
The product of its (nonzero) digits is 216000, while the sum is 37.
Adding to 22532523220135 its reverse (53102232523522), we get a palindrome (75634755743657).
The spelling of 22532523220135 in words is "twenty-two trillion, five hundred thirty-two billion, five hundred twenty-three million, two hundred twenty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •