Base | Representation |
---|---|
bin | 10000010011000101011… |
… | …000011110100100000010 |
3 | 10222001220221021201201020 |
4 | 100103011120132210002 |
5 | 121322231233301104 |
6 | 2214304451450310 |
7 | 143626501431066 |
oct | 20230530364402 |
9 | 3861827251636 |
10 | 1120003025154 |
11 | 3a1a99566942 |
12 | 1610928b6996 |
13 | 81800ca1b30 |
14 | 3c2cbd39aa6 |
15 | 1e201b182d9 |
hex | 104c561e902 |
1120003025154 has 64 divisors (see below), whose sum is σ = 2448672436224. Its totient is φ = 339423771456.
The previous prime is 1120003025143. The next prime is 1120003025171. The reversal of 1120003025154 is 4515203000211.
It is a happy number.
It is a super-2 number, since 2×11200030251542 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54669397 + ... + 54689879.
It is an arithmetic number, because the mean of its divisors is an integer number (38260506816).
Almost surely, 21120003025154 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1120003025154, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1224336218112).
1120003025154 is an abundant number, since it is smaller than the sum of its proper divisors (1328669411070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120003025154 is a wasteful number, since it uses less digits than its factorization.
1120003025154 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31031.
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 1120003025154 its reverse (4515203000211), we get a palindrome (5635206025365).
The spelling of 1120003025154 in words is "one trillion, one hundred twenty billion, three million, twenty-five thousand, one hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •