Base | Representation |
---|---|
bin | 1001010010111101011011… |
… | …1011110110101101111110 |
3 | 1100012011001021201101122212 |
4 | 2110233112323312231332 |
5 | 2314431242300241110 |
6 | 33423340551540422 |
7 | 2103316110532613 |
oct | 224572673665576 |
9 | 40164037641585 |
10 | 10221333212030 |
11 | 3290930146166 |
12 | 1190b6798a712 |
13 | 591b38118285 |
14 | 274a025c050a |
15 | 12ad311d3e05 |
hex | 94bd6ef6b7e |
10221333212030 has 16 divisors (see below), whose sum is σ = 18493728281424. Its totient is φ = 4067349173760.
The previous prime is 10221333212003. The next prime is 10221333212039. The reversal of 10221333212030 is 3021233312201.
It is a junction number, because it is equal to n+sod(n) for n = 10221333211987 and 10221333212005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221333212039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2648011856 + ... + 2648015715.
It is an arithmetic number, because the mean of its divisors is an integer number (1155858017589).
Almost surely, 210221333212030 is an apocalyptic number.
10221333212030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10221333212030 is a deficient number, since it is larger than the sum of its proper divisors (8272395069394).
10221333212030 is a wasteful number, since it uses less digits than its factorization.
10221333212030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5296027771.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10221333212030 its reverse (3021233312201), we get a palindrome (13242566524231).
The spelling of 10221333212030 in words is "ten trillion, two hundred twenty-one billion, three hundred thirty-three million, two hundred twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •