Base | Representation |
---|---|
bin | 1001100011110100111011… |
… | …11101100010011000000001 |
3 | 2202102201000122221000120222 |
4 | 10301322131331202120001 |
5 | 10223412001321213441 |
6 | 112413250302312425 |
7 | 4266543132353561 |
oct | 461723575423001 |
9 | 82381018830528 |
10 | 21022220101121 |
11 | 6775523220868 |
12 | 24362b6b88715 |
13 | b96504ba5cb5 |
14 | 5296a377ada1 |
15 | 266c82205d4b |
hex | 131e9df62601 |
21022220101121 has 8 divisors (see below), whose sum is σ = 21151502057280. Its totient is φ = 20892941941392.
The previous prime is 21022220101027. The next prime is 21022220101153. The reversal of 21022220101121 is 12110102222012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21022220101121 - 226 = 21022152992257 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21022220101121.
It is not an unprimeable number, because it can be changed into a prime (21022220100121) 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, 10589660 + ... + 12417138.
It is an arithmetic number, because the mean of its divisors is an integer number (2643937757160).
Almost surely, 221022220101121 is an apocalyptic number.
It is an amenable number.
21022220101121 is a deficient number, since it is larger than the sum of its proper divisors (129281956159).
21022220101121 is a wasteful number, since it uses less digits than its factorization.
21022220101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1898215.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21022220101121 its reverse (12110102222012), we get a palindrome (33132322323133).
The spelling of 21022220101121 in words is "twenty-one trillion, twenty-two billion, two hundred twenty million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •