Base | Representation |
---|---|
bin | 1001000111001111110010… |
… | …0100010110000011011101 |
3 | 1022110220122002000221221111 |
4 | 2101303330210112003131 |
5 | 2303132131341321341 |
6 | 33151100525502021 |
7 | 2052633306140323 |
oct | 221637444260335 |
9 | 38426562027844 |
10 | 10020101120221 |
11 | 321355694a175 |
12 | 1159b67711911 |
13 | 578b787797ba |
14 | 268d92a17d13 |
15 | 1259a49d5681 |
hex | 91cfc9160dd |
10020101120221 has 16 divisors (see below), whose sum is σ = 10408250952000. Its totient is φ = 9639061141248.
The previous prime is 10020101120191. The next prime is 10020101120257. The reversal of 10020101120221 is 12202110102001.
10020101120221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10020101120221 - 223 = 10020092731613 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020101120321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14083755 + ... + 14778103.
It is an arithmetic number, because the mean of its divisors is an integer number (650515684500).
Almost surely, 210020101120221 is an apocalyptic number.
It is an amenable number.
10020101120221 is a deficient number, since it is larger than the sum of its proper divisors (388149831779).
10020101120221 is an equidigital number, since it uses as much as digits as its factorization.
10020101120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 699468.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10020101120221 its reverse (12202110102001), we get a palindrome (22222211222222).
The spelling of 10020101120221 in words is "ten trillion, twenty billion, one hundred one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •