Base | Representation |
---|---|
bin | 11001000010011110011101… |
… | …101111101101010000100001 |
3 | 112102220111100122102021210202 |
4 | 121002132131233231100201 |
5 | 103413211422113444301 |
6 | 1030113011031034545 |
7 | 32124000536335343 |
oct | 3102363557552041 |
9 | 472814318367722 |
10 | 110121313031201 |
11 | 320a720639306a |
12 | 104262b8b0ba55 |
13 | 495a51a506c64 |
14 | 1d29c857db293 |
15 | cae794ace66b |
hex | 64279dbed421 |
110121313031201 has 16 divisors (see below), whose sum is σ = 119124541197648. Its totient is φ = 101416303411200.
The previous prime is 110121313031161. The next prime is 110121313031263. The reversal of 110121313031201 is 102130313121011.
It can be written as a sum of positive squares in 8 ways, for example, as 11968141201 + 110109344890000 = 109399^2 + 10493300^2 .
It is a cyclic number.
It is not a de Polignac number, because 110121313031201 - 230 = 110120239289377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110121313021201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 274909190 + ... + 275309471.
It is an arithmetic number, because the mean of its divisors is an integer number (7445283824853).
Almost surely, 2110121313031201 is an apocalyptic number.
It is an amenable number.
110121313031201 is a deficient number, since it is larger than the sum of its proper divisors (9003228166447).
110121313031201 is a wasteful number, since it uses less digits than its factorization.
110121313031201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 550218932.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 110121313031201 its reverse (102130313121011), we get a palindrome (212251626152212).
The spelling of 110121313031201 in words is "one hundred ten trillion, one hundred twenty-one billion, three hundred thirteen million, thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •