Base | Representation |
---|---|
bin | 10000000011010110000… |
… | …000111100110111010100 |
3 | 10220110022002101220220012 |
4 | 100003112000330313110 |
5 | 121033123130420200 |
6 | 2202431432255352 |
7 | 142460621001131 |
oct | 20032600746724 |
9 | 3813262356805 |
10 | 1103102201300 |
11 | 395906486820 |
12 | 159956841558 |
13 | 800396c4248 |
14 | 3b5674b5588 |
15 | 1da62ed1a35 |
hex | 100d603cdd4 |
1103102201300 has 72 divisors (see below), whose sum is σ = 2625771544032. Its totient is φ = 398911824000.
The previous prime is 1103102201281. The next prime is 1103102201303. The reversal of 1103102201300 is 31022013011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103102201303) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2571122 + ... + 2969321.
Almost surely, 21103102201300 is an apocalyptic number.
1103102201300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1103102201300 is an abundant number, since it is smaller than the sum of its proper divisors (1522669342732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103102201300 is a wasteful number, since it uses less digits than its factorization.
1103102201300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5540649 (or 5540642 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1103102201300 its reverse (31022013011), we get a palindrome (1134124214311).
It can be divided in two parts, 1 and 103102201300, that added together give a palindrome (103102201301).
The spelling of 1103102201300 in words is "one trillion, one hundred three billion, one hundred two million, two hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •