Base | Representation |
---|---|
bin | 11001000000101111011110… |
… | …000100011101101100010001 |
3 | 112102111002201210102000100221 |
4 | 121000233132010131230101 |
5 | 103404233332040130001 |
6 | 1025542140552113041 |
7 | 32112251256026500 |
oct | 3100573604355421 |
9 | 472432653360327 |
10 | 110002133130001 |
11 | 32060708447352 |
12 | 10407197995781 |
13 | 494c2061bbb68 |
14 | 1d241bb372837 |
15 | cab61bb211a1 |
hex | 640bde11db11 |
110002133130001 has 6 divisors (see below), whose sum is σ = 127961665069650. Its totient is φ = 94287542682816.
The previous prime is 110002133129947. The next prime is 110002133130011. The reversal of 110002133130001 is 100031331200011.
It can be written as a sum of positive squares in only one way, i.e., 104771581168401 + 5230551961600 = 10235799^2 + 2287040^2 .
It is not a de Polignac number, because 110002133130001 - 27 = 110002133129873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110002133130011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1122470746176 + ... + 1122470746273.
It is an arithmetic number, because the mean of its divisors is an integer number (21326944178275).
Almost surely, 2110002133130001 is an apocalyptic number.
It is an amenable number.
110002133130001 is a deficient number, since it is larger than the sum of its proper divisors (17959531939649).
110002133130001 is an equidigital number, since it uses as much as digits as its factorization.
110002133130001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2244941492463 (or 2244941492456 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 110002133130001 its reverse (100031331200011), we get a palindrome (210033464330012).
The spelling of 110002133130001 in words is "one hundred ten trillion, two billion, one hundred thirty-three million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •