Base | Representation |
---|---|
bin | 1001000111111111111100… |
… | …1111111111110111110101 |
3 | 1022112011000011220221000021 |
4 | 2101333333033333313311 |
5 | 2303340121420120041 |
6 | 33201035534245141 |
7 | 2053601601363232 |
oct | 221777717776765 |
9 | 38464004827007 |
10 | 10033031020021 |
11 | 3218a914a5279 |
12 | 11605759567b1 |
13 | 57a159476199 |
14 | 26985bd36789 |
15 | 125eaebdbcd1 |
hex | 91fff3ffdf5 |
10033031020021 has 16 divisors (see below), whose sum is σ = 10226884687488. Its totient is φ = 9840148718400.
The previous prime is 10033031020007. The next prime is 10033031020027. The reversal of 10033031020021 is 12002013033001.
It is a cyclic number.
It is not a de Polignac number, because 10033031020021 - 25 = 10033031019989 is a prime.
It is a super-2 number, since 2×100330310200212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10033031019977 and 10033031020004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10033031020027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51341520 + ... + 51536566.
It is an arithmetic number, because the mean of its divisors is an integer number (639180292968).
Almost surely, 210033031020021 is an apocalyptic number.
It is an amenable number.
10033031020021 is a deficient number, since it is larger than the sum of its proper divisors (193853667467).
10033031020021 is a wasteful number, since it uses less digits than its factorization.
10033031020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197532.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10033031020021 its reverse (12002013033001), we get a palindrome (22035044053022).
The spelling of 10033031020021 in words is "ten trillion, thirty-three billion, thirty-one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •