Base | Representation |
---|---|
bin | 110100011101010101… |
… | …0100111100100000001 |
3 | 101202210000020200100001 |
4 | 1220322222213210001 |
5 | 3321203232302241 |
6 | 123430253200001 |
7 | 11065441050310 |
oct | 1507252474401 |
9 | 352700220301 |
10 | 112653400321 |
11 | 438599a9040 |
12 | 199bb490001 |
13 | a814148b77 |
14 | 5649766277 |
15 | 2de5025431 |
hex | 1a3aaa7901 |
112653400321 has 32 divisors (see below), whose sum is σ = 147026515968. Its totient is φ = 83696595840.
The previous prime is 112653400309. The next prime is 112653400331. The reversal of 112653400321 is 123004356211.
It is not a de Polignac number, because 112653400321 - 27 = 112653400193 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112653400321.
It is not an unprimeable number, because it can be changed into a prime (112653400331) 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 31 ways as a sum of consecutive naturals, for example, 452710 + ... + 655936.
It is an arithmetic number, because the mean of its divisors is an integer number (4594578624).
Almost surely, 2112653400321 is an apocalyptic number.
112653400321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112653400321 is a deficient number, since it is larger than the sum of its proper divisors (34373115647).
112653400321 is a wasteful number, since it uses less digits than its factorization.
112653400321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203581.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 112653400321 its reverse (123004356211), we get a palindrome (235657756532).
The spelling of 112653400321 in words is "one hundred twelve billion, six hundred fifty-three million, four hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •