Base | Representation |
---|---|
bin | 101101001000111110010… |
… | …010110011001001100110 |
3 | 101222112211111220120100120 |
4 | 231020332102303021212 |
5 | 401310404421100311 |
6 | 10333013332022410 |
7 | 440053510504320 |
oct | 55107622631146 |
9 | 11875744816316 |
10 | 3102011503206 |
11 | a96612695a20 |
12 | 421235461a06 |
13 | 196697cb3815 |
14 | aa1d1168610 |
15 | 55a55364706 |
hex | 2d23e4b3266 |
3102011503206 has 128 divisors (see below), whose sum is σ = 7752239778816. Its totient is φ = 803911342080.
The previous prime is 3102011503183. The next prime is 3102011503223. The reversal of 3102011503206 is 6023051102013.
3102011503206 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 750545116 + ... + 750549248.
It is an arithmetic number, because the mean of its divisors is an integer number (60564373272).
Almost surely, 23102011503206 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3102011503206, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3876119889408).
3102011503206 is an abundant number, since it is smaller than the sum of its proper divisors (4650228275610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3102011503206 is a wasteful number, since it uses less digits than its factorization.
3102011503206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7406.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 3102011503206 its reverse (6023051102013), we get a palindrome (9125062605219).
The spelling of 3102011503206 in words is "three trillion, one hundred two billion, eleven million, five hundred three thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •