Base | Representation |
---|---|
bin | 10111011111011010000001… |
… | …001010010110001011001000 |
3 | 111112210122201020012200202120 |
4 | 113133122001022112023020 |
5 | 102020141124414423422 |
6 | 1003421251325331240 |
7 | 30522066066122526 |
oct | 2737320112261310 |
9 | 445718636180676 |
10 | 103313310311112 |
11 | 2aa11a24330970 |
12 | b70698a706b20 |
13 | 4585532244585 |
14 | 1b725688b1316 |
15 | be2639ebd45c |
hex | 5df6812962c8 |
103313310311112 has 64 divisors (see below), whose sum is σ = 285969000096000. Its totient is φ = 30839794117440.
The previous prime is 103313310311063. The next prime is 103313310311177. The reversal of 103313310311112 is 211113013313301.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 2920417362 + ... + 2920452737.
It is an arithmetic number, because the mean of its divisors is an integer number (4468265626500).
Almost surely, 2103313310311112 is an apocalyptic number.
103313310311112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103313310311112 is an abundant number, since it is smaller than the sum of its proper divisors (182655689784888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103313310311112 is a wasteful number, since it uses less digits than its factorization.
103313310311112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5840870186 (or 5840870182 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 103313310311112 its reverse (211113013313301), we get a palindrome (314426323624413).
The spelling of 103313310311112 in words is "one hundred three trillion, three hundred thirteen billion, three hundred ten million, three hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •