Base | Representation |
---|---|
bin | 1010000111001000111100… |
… | …01011100100110000110000 |
3 | 2220201200211212000220100201 |
4 | 11003210132023210300300 |
5 | 10403301402310321112 |
6 | 115142512132524544 |
7 | 4453315464605200 |
oct | 503443613446060 |
9 | 86650755026321 |
10 | 22235552042032 |
11 | 70a30544a243a |
12 | 25b1495480754 |
13 | c53a5a564a24 |
14 | 56c2c675a400 |
15 | 2885e7561257 |
hex | 14391e2e4c30 |
22235552042032 has 30 divisors (see below), whose sum is σ = 50115077116908. Its totient is φ = 9529522303392.
The previous prime is 22235552042029. The next prime is 22235552042071. The reversal of 22235552042032 is 23024025553222.
It is a happy number.
It is a super-2 number, since 2×222355520420322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22235552041982 and 22235552042000.
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 5 ways as a sum of consecutive naturals, for example, 14180835978 + ... + 14180837545.
Almost surely, 222235552042032 is an apocalyptic number.
It is an amenable number.
22235552042032 is an abundant number, since it is smaller than the sum of its proper divisors (27879525074876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22235552042032 is a wasteful number, since it uses less digits than its factorization.
22235552042032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28361673545 (or 28361673532 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 37.
Adding to 22235552042032 its reverse (23024025553222), we get a palindrome (45259577595254).
The spelling of 22235552042032 in words is "twenty-two trillion, two hundred thirty-five billion, five hundred fifty-two million, forty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •