Base | Representation |
---|---|
bin | 10000000001011111011… |
… | …101010000010011000110 |
3 | 10220021011110121202002101 |
4 | 100001133131100103012 |
5 | 121020034430212410 |
6 | 2201502215502314 |
7 | 142360416124006 |
oct | 20013735202306 |
9 | 3807143552071 |
10 | 1101113132230 |
11 | 394a85725791 |
12 | 1594a068799a |
13 | 7cab05a63b7 |
14 | 3b419264006 |
15 | 1d99857cd3a |
hex | 1005f7504c6 |
1101113132230 has 32 divisors (see below), whose sum is σ = 2068238349504. Its totient is φ = 421283106816.
The previous prime is 1101113132227. The next prime is 1101113132279. The reversal of 1101113132230 is 322313111011.
It is a super-2 number, since 2×11011131322302 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101113132198 and 1101113132207.
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, 13394934 + ... + 13476886.
It is an arithmetic number, because the mean of its divisors is an integer number (64632448422).
Almost surely, 21101113132230 is an apocalyptic number.
1101113132230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101113132230 is a deficient number, since it is larger than the sum of its proper divisors (967125217274).
1101113132230 is a wasteful number, since it uses less digits than its factorization.
1101113132230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140400.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1101113132230 its reverse (322313111011), we get a palindrome (1423426243241).
The spelling of 1101113132230 in words is "one trillion, one hundred one billion, one hundred thirteen million, one hundred thirty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •