Base | Representation |
---|---|
bin | 1001001101001000000100… |
… | …1011011111010010110011 |
3 | 1022211120100120110222121021 |
4 | 2103102001023133102303 |
5 | 2311311013204101003 |
6 | 33305323541240311 |
7 | 2063140355265454 |
oct | 223220113372263 |
9 | 38746316428537 |
10 | 10121110222003 |
11 | 325237a955390 |
12 | 1175657403097 |
13 | 585555362191 |
14 | 26dc15ab512b |
15 | 1284175ed2bd |
hex | 934812df4b3 |
10121110222003 has 8 divisors (see below), whose sum is σ = 11041461094320. Its totient is φ = 9200801006880.
The previous prime is 10121110221979. The next prime is 10121110222019. The reversal of 10121110222003 is 30022201112101.
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 10121110222003 - 213 = 10121110213811 is a prime.
It is a super-5 number, since 5×101211102220035 (a number of 66 digits) contains 55555 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10121110222043) 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, 9905200 + ... + 10879117.
It is an arithmetic number, because the mean of its divisors is an integer number (1380182636790).
Almost surely, 210121110222003 is an apocalyptic number.
10121110222003 is a deficient number, since it is larger than the sum of its proper divisors (920350872317).
10121110222003 is a wasteful number, since it uses less digits than its factorization.
10121110222003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20828597.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10121110222003 its reverse (30022201112101), we get a palindrome (40143311334104).
The spelling of 10121110222003 in words is "ten trillion, one hundred twenty-one billion, one hundred ten million, two hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •