Base | Representation |
---|---|
bin | 101100100010001110000… |
… | …011110001111010101000 |
3 | 101211120102112122202111022 |
4 | 230202032003301322220 |
5 | 400120144404222222 |
6 | 10301532310352012 |
7 | 434051365245404 |
oct | 54421603617250 |
9 | 11746375582438 |
10 | 3060400070312 |
11 | a7a9aa067562 |
12 | 41516195b608 |
13 | 192796124690 |
14 | a81a496c104 |
15 | 5491c171042 |
hex | 2c88e0f1ea8 |
3060400070312 has 64 divisors (see below), whose sum is σ = 6238246855680. Its totient is φ = 1399103246592.
The previous prime is 3060400070269. The next prime is 3060400070339. The reversal of 3060400070312 is 2130700040603.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 114638438 + ... + 114665130.
It is an arithmetic number, because the mean of its divisors is an integer number (97472607120).
Almost surely, 23060400070312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3060400070312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3119123427840).
3060400070312 is an abundant number, since it is smaller than the sum of its proper divisors (3177846785368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3060400070312 is a wasteful number, since it uses less digits than its factorization.
3060400070312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37122 (or 37118 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 26.
The spelling of 3060400070312 in words is "three trillion, sixty billion, four hundred million, seventy thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •