Base | Representation |
---|---|
bin | 1001100110101110110010… |
… | …10111100010100001001011 |
3 | 2202210020120120022221102020 |
4 | 10303113121113202201023 |
5 | 10232030324230133003 |
6 | 112531151401535523 |
7 | 4310004606236541 |
oct | 463273127424113 |
9 | 82706516287366 |
10 | 21122001021003 |
11 | 6803876a21813 |
12 | 24517034a45a3 |
13 | ba2a471aa91c |
14 | 53044b68dd91 |
15 | 2696720b7d53 |
hex | 1335d95e284b |
21122001021003 has 8 divisors (see below), whose sum is σ = 28694039123088. Its totient is φ = 13815648466464.
The previous prime is 21122001020957. The next prime is 21122001021019. The reversal of 21122001021003 is 30012010022112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21122001021003 - 210 = 21122001019979 is a prime.
It is a super-2 number, since 2×211220010210032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21122001021103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66421386700 + ... + 66421387017.
It is an arithmetic number, because the mean of its divisors is an integer number (3586754890386).
Almost surely, 221122001021003 is an apocalyptic number.
21122001021003 is a deficient number, since it is larger than the sum of its proper divisors (7572038102085).
21122001021003 is a wasteful number, since it uses less digits than its factorization.
21122001021003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132842773773.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 21122001021003 its reverse (30012010022112), we get a palindrome (51134011043115).
The spelling of 21122001021003 in words is "twenty-one trillion, one hundred twenty-two billion, one million, twenty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •