Base | Representation |
---|---|
bin | 101110110110111101110… |
… | …000100001110101101000 |
3 | 102101211200021211010110102 |
4 | 232312331300201311220 |
5 | 410224243203320130 |
6 | 10503144445004532 |
7 | 451434300256346 |
oct | 56667560416550 |
9 | 12354607733412 |
10 | 3220114120040 |
11 | 1031708521a84 |
12 | 4400b5853748 |
13 | 1a486a07244c |
14 | b1bd64c8996 |
15 | 58b68977645 |
hex | 2edbdc21d68 |
3220114120040 has 64 divisors (see below), whose sum is σ = 7256216682000. Its totient is φ = 1286098124800.
The previous prime is 3220114119977. The next prime is 3220114120073. The reversal of 3220114120040 is 400214110223.
It can be written as a sum of positive squares in 8 ways, for example, as 3181935304804 + 38178815236 = 1783798^2 + 195394^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 3220114119994 and 3220114120021.
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 15 ways as a sum of consecutive naturals, for example, 138780440 + ... + 138803640.
Almost surely, 23220114120040 is an apocalyptic number.
It is an amenable number.
3220114120040 is an abundant number, since it is smaller than the sum of its proper divisors (4036102561960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3220114120040 is a wasteful number, since it uses less digits than its factorization.
3220114120040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28310 (or 28306 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 3220114120040 its reverse (400214110223), we get a palindrome (3620328230263).
The spelling of 3220114120040 in words is "three trillion, two hundred twenty billion, one hundred fourteen million, one hundred twenty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •