Base | Representation |
---|---|
bin | 101100100101100101100… |
… | …010001001000110110100 |
3 | 101211220202111000212120010 |
4 | 230211211202021012310 |
5 | 400200100333143220 |
6 | 10303331125540220 |
7 | 434240102615202 |
oct | 54454542110664 |
9 | 11756674025503 |
10 | 3064015131060 |
11 | a81494732174 |
12 | 4159b0574670 |
13 | 192c21078990 |
14 | a8428b1c072 |
15 | 54a7e70a1e0 |
hex | 2c9658891b4 |
3064015131060 has 192 divisors, whose sum is σ = 9848327328000. Its totient is φ = 705088708608.
The previous prime is 3064015131059. The next prime is 3064015131109. The reversal of 3064015131060 is 601315104603.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 1200331 + ... + 2751149.
It is an arithmetic number, because the mean of its divisors is an integer number (51293371500).
Almost surely, 23064015131060 is an apocalyptic number.
3064015131060 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3064015131060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4924163664000).
3064015131060 is an abundant number, since it is smaller than the sum of its proper divisors (6784312196940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3064015131060 is a wasteful number, since it uses less digits than its factorization.
3064015131060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1551010 (or 1551008 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
The spelling of 3064015131060 in words is "three trillion, sixty-four billion, fifteen million, one hundred thirty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •