Base | Representation |
---|---|
bin | 101101001000111110010… |
… | …001011000110010101110 |
3 | 101222112211111012202200000 |
4 | 231020332101120302232 |
5 | 401310404322224402 |
6 | 10333013320045130 |
7 | 440053504403310 |
oct | 55107621306256 |
9 | 11875744182600 |
10 | 3102011133102 |
11 | a96612462952 |
12 | 4212353037a6 |
13 | 196697bb421b |
14 | aa1d10ad7b0 |
15 | 55a552dec1c |
hex | 2d23e458cae |
3102011133102 has 96 divisors (see below), whose sum is σ = 7966188851712. Its totient is φ = 886229856864.
The previous prime is 3102011133083. The next prime is 3102011133113. The reversal of 3102011133102 is 2013311102013.
3102011133102 is a `hidden beast` number, since 310 + 20 + 1 + 1 + 1 + 331 + 0 + 2 = 666.
3102011133102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 92269248 + ... + 92302860.
It is an arithmetic number, because the mean of its divisors is an integer number (82981133872).
Almost surely, 23102011133102 is an apocalyptic number.
3102011133102 is an abundant number, since it is smaller than the sum of its proper divisors (4864177718610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3102011133102 is a wasteful number, since it uses less digits than its factorization.
3102011133102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60764 (or 60752 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 3102011133102 its reverse (2013311102013), we get a palindrome (5115322235115).
The spelling of 3102011133102 in words is "three trillion, one hundred two billion, eleven million, one hundred thirty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •