Base | Representation |
---|---|
bin | 11001000000101110100111… |
… | …001110111100110011111111 |
3 | 112102111000100200021021102001 |
4 | 121000232213032330303333 |
5 | 103404224441030211111 |
6 | 1025541505405243131 |
7 | 32112216415130614 |
oct | 3100564716746377 |
9 | 472430320237361 |
10 | 110001213132031 |
11 | 320602860a6251 |
12 | 10406b7b8634a7 |
13 | 494c0ba712c70 |
14 | 1d241310cc50b |
15 | cab5b5e941c1 |
hex | 640ba73bccff |
110001213132031 has 8 divisors (see below), whose sum is σ = 118463016200480. Its totient is φ = 101539434533472.
The previous prime is 110001213132007. The next prime is 110001213132079. The reversal of 110001213132031 is 130231312100011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110001213132031 - 233 = 109992623197439 is a prime.
It is a super-2 number, since 2×1100012131320312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110001213132631) 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, 3816550 + ... + 15315628.
It is an arithmetic number, because the mean of its divisors is an integer number (14807877025060).
Almost surely, 2110001213132031 is an apocalyptic number.
110001213132031 is a deficient number, since it is larger than the sum of its proper divisors (8461803068449).
110001213132031 is a wasteful number, since it uses less digits than its factorization.
110001213132031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12234945.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 110001213132031 its reverse (130231312100011), we get a palindrome (240232525232042).
The spelling of 110001213132031 in words is "one hundred ten trillion, one billion, two hundred thirteen million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •