Base | Representation |
---|---|
bin | 11101101011111100000… |
… | …11001011010101011111 |
3 | 10121111212002100222110120 |
4 | 32311332003023111133 |
5 | 113203001113324411 |
6 | 2100331443410023 |
7 | 133460045016426 |
oct | 16657603132537 |
9 | 3544762328416 |
10 | 1020022011231 |
11 | 363652919313 |
12 | 14582b383913 |
13 | 752593ac172 |
14 | 3752561c2bd |
15 | 1b7ee3ce106 |
hex | ed7e0cb55f |
1020022011231 has 8 divisors (see below), whose sum is σ = 1419161059200. Its totient is φ = 650448818712.
The previous prime is 1020022011193. The next prime is 1020022011233. The reversal of 1020022011231 is 1321102200201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1020022011231 - 211 = 1020022009183 is a prime.
It is a super-2 number, since 2×10200220112312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1020022011231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020022011233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7391463781 + ... + 7391463918.
It is an arithmetic number, because the mean of its divisors is an integer number (177395132400).
Almost surely, 21020022011231 is an apocalyptic number.
1020022011231 is a deficient number, since it is larger than the sum of its proper divisors (399139047969).
1020022011231 is a wasteful number, since it uses less digits than its factorization.
1020022011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14782927725.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1020022011231 its reverse (1321102200201), we get a palindrome (2341124211432).
The spelling of 1020022011231 in words is "one trillion, twenty billion, twenty-two million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •