Base | Representation |
---|---|
bin | 10000000011011100011… |
… | …100001101010110010010 |
3 | 10220110120121021011122002 |
4 | 100003130130031112102 |
5 | 121033333230310002 |
6 | 2202450243114002 |
7 | 142463400235202 |
oct | 20033434152622 |
9 | 3813517234562 |
10 | 1103210010002 |
11 | 395961321021 |
12 | 159986972902 |
13 | 80055b40089 |
14 | 3b57793a402 |
15 | 1da6c6ca002 |
hex | 100dc70d592 |
1103210010002 has 32 divisors (see below), whose sum is σ = 1669395087360. Its totient is φ = 546766355520.
The previous prime is 1103210009983. The next prime is 1103210010011. The reversal of 1103210010002 is 2000100123011.
It is a super-2 number, since 2×11032100100022 (a number of 25 digits) contains 22 as substring.
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, 265256399 + ... + 265260557.
It is an arithmetic number, because the mean of its divisors is an integer number (52168596480).
Almost surely, 21103210010002 is an apocalyptic number.
1103210010002 is a deficient number, since it is larger than the sum of its proper divisors (566185077358).
1103210010002 is a wasteful number, since it uses less digits than its factorization.
1103210010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6458.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1103210010002 its reverse (2000100123011), we get a palindrome (3103310133013).
The spelling of 1103210010002 in words is "one trillion, one hundred three billion, two hundred ten million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •