Base | Representation |
---|---|
bin | 1001000111010011001000… |
… | …1101111101001111111000 |
3 | 1022110222221210201211020112 |
4 | 2101310302031331033320 |
5 | 2303141002303033422 |
6 | 33151330122043452 |
7 | 2052664515646220 |
oct | 221646215751770 |
9 | 38428853654215 |
10 | 10021001221112 |
11 | 3213978a40302 |
12 | 115a179049588 |
13 | 578c900aa08b |
14 | 26903a39d080 |
15 | 125a08a31ee2 |
hex | 91d3237d3f8 |
10021001221112 has 32 divisors (see below), whose sum is σ = 21602158341120. Its totient is φ = 4268997949920.
The previous prime is 10021001221111. The next prime is 10021001221129. The reversal of 10021001221112 is 21112210012001.
It is a super-2 number, since 2×100210012211122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021001221111) 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, 535758464 + ... + 535777167.
It is an arithmetic number, because the mean of its divisors is an integer number (675067448160).
Almost surely, 210021001221112 is an apocalyptic number.
It is an amenable number.
10021001221112 is an abundant number, since it is smaller than the sum of its proper divisors (11581157120008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021001221112 is a wasteful number, since it uses less digits than its factorization.
10021001221112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1071535811 (or 1071535807 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10021001221112 its reverse (21112210012001), we get a palindrome (31133211233113).
The spelling of 10021001221112 in words is "ten trillion, twenty-one billion, one million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •