Base | Representation |
---|---|
bin | 111011001011011100100… |
… | …111100000101100011110 |
3 | 112101202222010112122220200 |
4 | 323023130213200230132 |
5 | 1013112141021011240 |
6 | 12352122412324330 |
7 | 566545422052305 |
oct | 73133447405436 |
9 | 15352863478820 |
10 | 4066740407070 |
11 | 1328770a38290 |
12 | 5581b31736a6 |
13 | 236651b3a973 |
14 | 100b8d09743c |
15 | 70bba34a930 |
hex | 3b2dc9e0b1e |
4066740407070 has 96 divisors (see below), whose sum is σ = 11932504852320. Its totient is φ = 951880715520.
The previous prime is 4066740407053. The next prime is 4066740407087. The reversal of 4066740407070 is 707040476604.
4066740407070 is a `hidden beast` number, since 406 + 6 + 74 + 0 + 40 + 70 + 70 = 666.
It is an interprime number because it is at equal distance from previous prime (4066740407053) and next prime (4066740407087).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
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, 70795749 + ... + 70853168.
It is an arithmetic number, because the mean of its divisors is an integer number (124296925545).
Almost surely, 24066740407070 is an apocalyptic number.
4066740407070 is an abundant number, since it is smaller than the sum of its proper divisors (7865764445250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4066740407070 is a wasteful number, since it uses less digits than its factorization.
4066740407070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141648970 (or 141648967 counting only the distinct ones).
The product of its (nonzero) digits is 790272, while the sum is 45.
The spelling of 4066740407070 in words is "four trillion, sixty-six billion, seven hundred forty million, four hundred seven thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •