Base | Representation |
---|---|
bin | 10000000011010001101… |
… | …101100110011111000000 |
3 | 10220110010001120201210220 |
4 | 100003101231212133000 |
5 | 121033001141120112 |
6 | 2202420333223040 |
7 | 142456053321123 |
oct | 20032155463700 |
9 | 3813101521726 |
10 | 1103030020032 |
11 | 395879765986 |
12 | 159936631a80 |
13 | 80027770935 |
14 | 3b55ba863ba |
15 | 1da5b9c498c |
hex | 100d1b667c0 |
1103030020032 has 56 divisors (see below), whose sum is σ = 2945708729856. Its totient is φ = 364240435968.
The previous prime is 1103030020021. The next prime is 1103030020069. The reversal of 1103030020032 is 2300200303011.
It is a junction number, because it is equal to n+sod(n) for n = 1103030019993 and 1103030020020.
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 7 ways as a sum of consecutive naturals, for example, 26825008 + ... + 26866095.
Almost surely, 21103030020032 is an apocalyptic number.
1103030020032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1103030020032 is an abundant number, since it is smaller than the sum of its proper divisors (1842678709824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103030020032 is a wasteful number, since it uses less digits than its factorization.
1103030020032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53691225 (or 53691215 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 1103030020032 its reverse (2300200303011), we get a palindrome (3403230323043).
The spelling of 1103030020032 in words is "one trillion, one hundred three billion, thirty million, twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •