Base | Representation |
---|---|
bin | 110011011010010000… |
… | …0010100011010111010 |
3 | 101112222010212211000002 |
4 | 1212310200110122322 |
5 | 3302101023203110 |
6 | 122415045513002 |
7 | 10655610135623 |
oct | 1466440243272 |
9 | 345863784002 |
10 | 110402553530 |
11 | 429043aa585 |
12 | 19491712762 |
13 | a545a23869 |
14 | 54b4850a4a |
15 | 2d12612aa5 |
hex | 19b48146ba |
110402553530 has 32 divisors (see below), whose sum is σ = 199065988800. Its totient is φ = 44085231232.
The previous prime is 110402553523. The next prime is 110402553533. The reversal of 110402553530 is 35355204011.
110402553530 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 110402553493 and 110402553502.
It is not an unprimeable number, because it can be changed into a prime (110402553533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16225109 + ... + 16231911.
It is an arithmetic number, because the mean of its divisors is an integer number (6220812150).
Almost surely, 2110402553530 is an apocalyptic number.
110402553530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110402553530 is a deficient number, since it is larger than the sum of its proper divisors (88663435270).
110402553530 is a wasteful number, since it uses less digits than its factorization.
110402553530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9358.
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 110402553530 its reverse (35355204011), we get a palindrome (145757757541).
The spelling of 110402553530 in words is "one hundred ten billion, four hundred two million, five hundred fifty-three thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •