Base | Representation |
---|---|
bin | 10110111101111001000000… |
… | …011000011101001100111101 |
3 | 111020122110210000020001102112 |
4 | 112331321000120131030331 |
5 | 101214422211440121341 |
6 | 554455224201503405 |
7 | 30163511651144000 |
oct | 2675710030351475 |
9 | 436573700201375 |
10 | 101010121020221 |
11 | 2a204173a95396 |
12 | b3b45311a1b65 |
13 | 44492a11c233a |
14 | 1ad2cb74c1537 |
15 | ba278984baeb |
hex | 5bde4061d33d |
101010121020221 has 64 divisors (see below), whose sum is σ = 125249716800000. Its totient is φ = 81194165337600.
The previous prime is 101010121020217. The next prime is 101010121020269. The reversal of 101010121020221 is 122020121010101.
It is not a de Polignac number, because 101010121020221 - 22 = 101010121020217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101010121020196 and 101010121020205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101010121022221) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3849898115 + ... + 3849924351.
It is an arithmetic number, because the mean of its divisors is an integer number (1957026825000).
Almost surely, 2101010121020221 is an apocalyptic number.
It is an amenable number.
101010121020221 is a deficient number, since it is larger than the sum of its proper divisors (24239595779779).
101010121020221 is a wasteful number, since it uses less digits than its factorization.
101010121020221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32227 (or 32213 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101010121020221 its reverse (122020121010101), we get a palindrome (223030242030322).
The spelling of 101010121020221 in words is "one hundred one trillion, ten billion, one hundred twenty-one million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •