Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …110000011101101101000 |
3 | 10220100111011220211110021 |
4 | 100002111012003231220 |
5 | 121023410313133112 |
6 | 2202131403330224 |
7 | 142421624060350 |
oct | 20022506035550 |
9 | 3810434824407 |
10 | 1102013021032 |
11 | 3953a7691540 |
12 | 1596b1b20974 |
13 | 7cbc4b61291 |
14 | 3b4a2991b60 |
15 | 1d9ec586907 |
hex | 10095183b68 |
1102013021032 has 64 divisors (see below), whose sum is σ = 2601145497600. Its totient is φ = 425187195840.
The previous prime is 1102013021009. The next prime is 1102013021059. The reversal of 1102013021032 is 2301203102011.
It is a junction number, because it is equal to n+sod(n) for n = 1102013020997 and 1102013021015.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8620932 + ... + 8747827.
It is an arithmetic number, because the mean of its divisors is an integer number (40642898400).
Almost surely, 21102013021032 is an apocalyptic number.
It is an amenable number.
1102013021032 is an abundant number, since it is smaller than the sum of its proper divisors (1499132476568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102013021032 is a wasteful number, since it uses less digits than its factorization.
1102013021032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17368886 (or 17368882 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1102013021032 its reverse (2301203102011), we get a palindrome (3403216123043).
The spelling of 1102013021032 in words is "one trillion, one hundred two billion, thirteen million, twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •