Base | Representation |
---|---|
bin | 110011100001000111… |
… | …1011101011101011010 |
3 | 101120120012112110212220 |
4 | 1213002033131131122 |
5 | 3303034022441010 |
6 | 122454001244510 |
7 | 10664406053421 |
oct | 1470217353532 |
9 | 346505473786 |
10 | 110633015130 |
11 | 42a124a8810 |
12 | 19536933736 |
13 | a5816b4c81 |
14 | 54d72c22b8 |
15 | 2d27987970 |
hex | 19c23dd75a |
110633015130 has 128 divisors (see below), whose sum is σ = 313143736320. Its totient is φ = 24721770240.
The previous prime is 110633015099. The next prime is 110633015173. The reversal of 110633015130 is 31510336011.
It is a self number, because there is not a number n which added to its sum of digits gives 110633015130.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6454 + ... + 470433.
It is an arithmetic number, because the mean of its divisors is an integer number (2446435440).
Almost surely, 2110633015130 is an apocalyptic number.
110633015130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 110633015130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156571868160).
110633015130 is an abundant number, since it is smaller than the sum of its proper divisors (202510721190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110633015130 is a wasteful number, since it uses less digits than its factorization.
110633015130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476964.
The product of its (nonzero) digits is 810, while the sum is 24.
The spelling of 110633015130 in words is "one hundred ten billion, six hundred thirty-three million, fifteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •