Base | Representation |
---|---|
bin | 10000001100001100110… |
… | …011011000101010100110 |
3 | 10221100211210111112120020 |
4 | 100030030303120222212 |
5 | 121212111444423010 |
6 | 2211043202020010 |
7 | 143245355143446 |
oct | 20141463305246 |
9 | 3840753445506 |
10 | 1112611326630 |
11 | 3999460a7391 |
12 | 15b76b347606 |
13 | 80bc37a301b |
14 | 3bbca37a126 |
15 | 1de1cc2a470 |
hex | 1030ccd8aa6 |
1112611326630 has 32 divisors (see below), whose sum is σ = 2670332673024. Its totient is φ = 296689077216.
The previous prime is 1112611326623. The next prime is 1112611326703. The reversal of 1112611326630 is 366231162111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1112611326591 and 1112611326600.
It is a congruent number.
It is an unprimeable number.
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, 850219 + ... + 1717001.
It is an arithmetic number, because the mean of its divisors is an integer number (83447896032).
Almost surely, 21112611326630 is an apocalyptic number.
1112611326630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1112611326630 is an abundant number, since it is smaller than the sum of its proper divisors (1557721346394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112611326630 is a wasteful number, since it uses less digits than its factorization.
1112611326630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909580.
The product of its (nonzero) digits is 7776, while the sum is 33.
Adding to 1112611326630 its reverse (366231162111), we get a palindrome (1478842488741).
The spelling of 1112611326630 in words is "one trillion, one hundred twelve billion, six hundred eleven million, three hundred twenty-six thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •