Base | Representation |
---|---|
bin | 101011110110010000101… |
… | …101110011010000000000 |
3 | 101200001121002101202100000 |
4 | 223312100231303100000 |
5 | 343332013200000000 |
6 | 10224124525200000 |
7 | 430460622256101 |
oct | 53662055632000 |
9 | 11601532352300 |
10 | 3013200000000 |
11 | a61988934093 |
12 | 407b8a700000 |
13 | 18b1b3488ba8 |
14 | a5ba80443a8 |
15 | 535a8500000 |
hex | 2bd90b73400 |
3013200000000 has 1188 divisors, whose sum is σ = 11642306539136. Its totient is φ = 777600000000.
The previous prime is 3013199999963. The next prime is 3013200000011. The reversal of 3013200000000 is 23103.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 97199999985 + ... + 97200000015.
Almost surely, 23013200000000 is an apocalyptic number.
3013200000000 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 3013200000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5821153269568).
3013200000000 is an abundant number, since it is smaller than the sum of its proper divisors (8629106539136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3013200000000 is an frugal number, since it uses more digits than its factorization.
3013200000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 9.
Adding to 3013200000000 its reverse (23103), we get a palindrome (3013200023103).
The spelling of 3013200000000 in words is "three trillion, thirteen billion, two hundred million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •