Base | Representation |
---|---|
bin | 10000010011000101110… |
… | …011011110000101101010 |
3 | 10222001221102121020002020 |
4 | 100103011303132011222 |
5 | 121322240041213343 |
6 | 2214305303245310 |
7 | 143626615531500 |
oct | 20230563360552 |
9 | 3861842536066 |
10 | 1120010101098 |
11 | 3a1aa255a129 |
12 | 161095149836 |
13 | 818025ab795 |
14 | 3c2ccc5c670 |
15 | 1e202564b83 |
hex | 104c5cde16a |
1120010101098 has 96 divisors (see below), whose sum is σ = 2628509958144. Its totient is φ = 317210650848.
The previous prime is 1120010101087. The next prime is 1120010101103. The reversal of 1120010101098 is 8901010100211.
It is a super-3 number, since 3×11200101010983 (a number of 37 digits) contains 333 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 45652111 + ... + 45676637.
It is an arithmetic number, because the mean of its divisors is an integer number (27380312064).
Almost surely, 21120010101098 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1120010101098, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1314254979072).
1120010101098 is an abundant number, since it is smaller than the sum of its proper divisors (1508499857046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120010101098 is a wasteful number, since it uses less digits than its factorization.
1120010101098 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25896 (or 25889 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 24.
The spelling of 1120010101098 in words is "one trillion, one hundred twenty billion, ten million, one hundred one thousand, ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •