Base | Representation |
---|---|
bin | 1001100110101011010010… |
… | …10100100110010101011011 |
3 | 2202210001201120010020112121 |
4 | 10303111221110212111123 |
5 | 10232013002011431021 |
6 | 112530241050522111 |
7 | 4306610202111646 |
oct | 463255124462533 |
9 | 82701646106477 |
10 | 21120121202011 |
11 | 6802aa18aa9a7 |
12 | 2451279a36337 |
13 | ba28078c19b0 |
14 | 53030db5aa5d |
15 | 2695b2044741 |
hex | 13356952655b |
21120121202011 has 8 divisors (see below), whose sum is σ = 22969941415344. Its totient is φ = 19302471775200.
The previous prime is 21120121201973. The next prime is 21120121202027. The reversal of 21120121202011 is 11020212102112.
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 21120121202011 - 211 = 21120121199963 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21120121202071) 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, 8042695261 + ... + 8042697886.
It is an arithmetic number, because the mean of its divisors is an integer number (2871242676918).
Almost surely, 221120121202011 is an apocalyptic number.
21120121202011 is a deficient number, since it is larger than the sum of its proper divisors (1849820213333).
21120121202011 is a wasteful number, since it uses less digits than its factorization.
21120121202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16085393261.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21120121202011 its reverse (11020212102112), we get a palindrome (32140333304123).
The spelling of 21120121202011 in words is "twenty-one trillion, one hundred twenty billion, one hundred twenty-one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •