Base | Representation |
---|---|
bin | 10000000000011101111… |
… | …001000101110110101110 |
3 | 10220011022210210000010200 |
4 | 100000131321011312232 |
5 | 121010311330230410 |
6 | 2201201123014330 |
7 | 142321231233564 |
oct | 20003571056656 |
9 | 3804283700120 |
10 | 1100013133230 |
11 | 394570811200 |
12 | 15923420a3a6 |
13 | 7c96672600b |
14 | 3b353125a34 |
15 | 1d931be73c0 |
hex | 1001de45dae |
1100013133230 has 72 divisors (see below), whose sum is σ = 3143673927576. Its totient is φ = 266669847840.
The previous prime is 1100013133211. The next prime is 1100013133243. The reversal of 1100013133230 is 323313100011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 50494764 + ... + 50516543.
It is an arithmetic number, because the mean of its divisors is an integer number (43662137883).
Almost surely, 21100013133230 is an apocalyptic number.
1100013133230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100013133230 is an abundant number, since it is smaller than the sum of its proper divisors (2043660794346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100013133230 is a wasteful number, since it uses less digits than its factorization.
1100013133230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101011342 (or 101011328 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1100013133230 its reverse (323313100011), we get a palindrome (1423326233241).
The spelling of 1100013133230 in words is "one trillion, one hundred billion, thirteen million, one hundred thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •