Base | Representation |
---|---|
bin | 101101111000100011101… |
… | …101110101111010000010 |
3 | 102011102201022202001122120 |
4 | 231320203231311322002 |
5 | 403130024413340411 |
6 | 10412303323345110 |
7 | 443542613053440 |
oct | 55704355657202 |
9 | 12142638661576 |
10 | 3153105215106 |
11 | 1006251768a00 |
12 | 42b114682196 |
13 | 19b44b512042 |
14 | ac87ac3bb90 |
15 | 57045c4c106 |
hex | 2de23b75e82 |
3153105215106 has 96 divisors (see below), whose sum is σ = 7923599760384. Its totient is φ = 818807589600.
The previous prime is 3153105215077. The next prime is 3153105215147. The reversal of 3153105215106 is 6015125013513.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 23773531 + ... + 23905793.
It is an arithmetic number, because the mean of its divisors is an integer number (82537497504).
Almost surely, 23153105215106 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3153105215106, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3961799880192).
3153105215106 is an abundant number, since it is smaller than the sum of its proper divisors (4770494545278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3153105215106 is a wasteful number, since it uses less digits than its factorization.
3153105215106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136988 (or 136977 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 33.
The spelling of 3153105215106 in words is "three trillion, one hundred fifty-three billion, one hundred five million, two hundred fifteen thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •