Base | Representation |
---|---|
bin | 1001100011011110011001… |
… | …10011001011001111111011 |
3 | 2202101112210110100121211012 |
4 | 10301233030303023033323 |
5 | 10223212211434342334 |
6 | 112403525533024135 |
7 | 4265634245661113 |
oct | 461571463131773 |
9 | 82345713317735 |
10 | 21010121012219 |
11 | 6770384640239 |
12 | 2433a9b02504b |
13 | b953273595b1 |
14 | 528c76928043 |
15 | 2667c4e109ce |
hex | 131bccccb3fb |
21010121012219 has 8 divisors (see below), whose sum is σ = 22246051771440. Its totient is φ = 19774194840576.
The previous prime is 21010121012191. The next prime is 21010121012263. The reversal of 21010121012219 is 91221012101012.
It is a happy number.
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 21010121012219 - 232 = 21005826044923 is a prime.
It is a super-2 number, since 2×210101210122192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21010121012194 and 21010121012203.
It is not an unprimeable number, because it can be changed into a prime (21010121017219) 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, 13990667 + ... + 15419435.
It is an arithmetic number, because the mean of its divisors is an integer number (2780756471430).
Almost surely, 221010121012219 is an apocalyptic number.
21010121012219 is a deficient number, since it is larger than the sum of its proper divisors (1235930759221).
21010121012219 is a wasteful number, since it uses less digits than its factorization.
21010121012219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2293789.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 21010121012219 in words is "twenty-one trillion, ten billion, one hundred twenty-one million, twelve thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •