Base | Representation |
---|---|
bin | 1001001101000111101010… |
… | …1011010000101011001110 |
3 | 1022211120001222011112101012 |
4 | 2103101322223100223032 |
5 | 2311310302241011342 |
6 | 33305305042445222 |
7 | 2063134561663352 |
oct | 223217253205316 |
9 | 38746058145335 |
10 | 10121001110222 |
11 | 3252324300062 |
12 | 1175626963812 |
13 | 58553887b1b2 |
14 | 26dc053d1462 |
15 | 12840cc48b82 |
hex | 9347aad0ace |
10121001110222 has 8 divisors (see below), whose sum is σ = 15352080336000. Its totient is φ = 5003640998224.
The previous prime is 10121001110173. The next prime is 10121001110251. The reversal of 10121001110222 is 22201110012101.
10121001110222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101210011102222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121001110197 and 10121001110206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28429778222 + ... + 28429778577.
It is an arithmetic number, because the mean of its divisors is an integer number (1919010042000).
Almost surely, 210121001110222 is an apocalyptic number.
10121001110222 is a deficient number, since it is larger than the sum of its proper divisors (5231079225778).
10121001110222 is an equidigital number, since it uses as much as digits as its factorization.
10121001110222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56859556890.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10121001110222 its reverse (22201110012101), we get a palindrome (32322111122323).
The spelling of 10121001110222 in words is "ten trillion, one hundred twenty-one billion, one million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •