Base | Representation |
---|---|
bin | 11001000010100110110000… |
… | …001010100111100000010011 |
3 | 112102221100022211102020210020 |
4 | 121002212300022213200103 |
5 | 103413333133233310003 |
6 | 1030121042043034523 |
7 | 32124434214402063 |
oct | 3102466012474023 |
9 | 472840284366706 |
10 | 110130212010003 |
11 | 320aaa626555a9 |
12 | 10427b8120ba43 |
13 | 495b3080769a3 |
14 | 1d2a48b6373a3 |
15 | caeb15ea3d53 |
hex | 6429b02a7813 |
110130212010003 has 4 divisors (see below), whose sum is σ = 146840282680008. Its totient is φ = 73420141340000.
The previous prime is 110130212009999. The next prime is 110130212010037. The reversal of 110130212010003 is 300010212031011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110130212010003 - 22 = 110130212009999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110130212010053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18355035334998 + ... + 18355035335003.
It is an arithmetic number, because the mean of its divisors is an integer number (36710070670002).
Almost surely, 2110130212010003 is an apocalyptic number.
110130212010003 is a deficient number, since it is larger than the sum of its proper divisors (36710070670005).
110130212010003 is an equidigital number, since it uses as much as digits as its factorization.
110130212010003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36710070670004.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 110130212010003 its reverse (300010212031011), we get a palindrome (410140424041014).
The spelling of 110130212010003 in words is "one hundred ten trillion, one hundred thirty billion, two hundred twelve million, ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •