Base | Representation |
---|---|
bin | 11001000010100110101011… |
… | …010011000010101000101001 |
3 | 112102221100010010201120220110 |
4 | 121002212223103002220221 |
5 | 103413333001331112301 |
6 | 1030121030004244533 |
7 | 32124432203220300 |
oct | 3102465323025051 |
9 | 472840103646813 |
10 | 110130130332201 |
11 | 320aaa20538891 |
12 | 10427b599a0749 |
13 | 495b2c4179a25 |
14 | 1d2a480855437 |
15 | caeb0dc1d0d6 |
hex | 6429ab4c2a29 |
110130130332201 has 48 divisors (see below), whose sum is σ = 173025221947200. Its totient is φ = 62118215050752.
The previous prime is 110130130332143. The next prime is 110130130332239. The reversal of 110130130332201 is 102233031031011.
It is a happy number.
It is not a de Polignac number, because 110130130332201 - 27 = 110130130332073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110130130372201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9777445 + ... + 17772413.
It is an arithmetic number, because the mean of its divisors is an integer number (3604692123900).
Almost surely, 2110130130332201 is an apocalyptic number.
It is an amenable number.
110130130332201 is a deficient number, since it is larger than the sum of its proper divisors (62895091614999).
110130130332201 is a wasteful number, since it uses less digits than its factorization.
110130130332201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7996198 (or 7996191 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 110130130332201 its reverse (102233031031011), we get a palindrome (212363161363212).
The spelling of 110130130332201 in words is "one hundred ten trillion, one hundred thirty billion, one hundred thirty million, three hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •