Base | Representation |
---|---|
bin | 1001100110101011010000… |
… | …00011110011011011110011 |
3 | 2202210001200002021012000212 |
4 | 10303111220003303123303 |
5 | 10232012431101201003 |
6 | 112530235012534335 |
7 | 4306606524066443 |
oct | 463255003633363 |
9 | 82701602235025 |
10 | 21120100022003 |
11 | 6802a90954064 |
12 | 24512729213ab |
13 | ba28033b7448 |
14 | 53030b006123 |
15 | 2695b025ddd8 |
hex | 1335680f36f3 |
21120100022003 has 4 divisors (see below), whose sum is σ = 21417566219568. Its totient is φ = 20822633824440.
The previous prime is 21120100021967. The next prime is 21120100022009. The reversal of 21120100022003 is 30022000102112.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21120100022003 - 214 = 21120100005619 is a prime.
It is a super-2 number, since 2×211201000220032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21120100022009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148733098676 + ... + 148733098817.
It is an arithmetic number, because the mean of its divisors is an integer number (5354391554892).
Almost surely, 221120100022003 is an apocalyptic number.
21120100022003 is a deficient number, since it is larger than the sum of its proper divisors (297466197565).
21120100022003 is an equidigital number, since it uses as much as digits as its factorization.
21120100022003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 297466197564.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 21120100022003 its reverse (30022000102112), we get a palindrome (51142100124115).
The spelling of 21120100022003 in words is "twenty-one trillion, one hundred twenty billion, one hundred million, twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •