Base | Representation |
---|---|
bin | 111011001011010000110… |
… | …111011110101010010100 |
3 | 112101202110101120212211022 |
4 | 323023100313132222110 |
5 | 1013111240034011302 |
6 | 12352051051100312 |
7 | 566540506304312 |
oct | 73132067365224 |
9 | 15352411525738 |
10 | 4066543266452 |
11 | 132867a728657 |
12 | 558159141698 |
13 | 236620045004 |
14 | 100b70c1b0b2 |
15 | 70ba7da88a2 |
hex | 3b2d0ddea94 |
4066543266452 has 12 divisors (see below), whose sum is σ = 7134197478996. Its totient is φ = 2028201129600.
The previous prime is 4066543266407. The next prime is 4066543266509. The reversal of 4066543266452 is 2546623456604.
It can be written as a sum of positive squares in 2 ways, for example, as 2550581478916 + 1515961787536 = 1597054^2 + 1231244^2 .
It is a super-2 number, since 2×40665432664522 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4066543266394 and 4066543266403.
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 3 ways as a sum of consecutive naturals, for example, 1267624103 + ... + 1267627310.
It is an arithmetic number, because the mean of its divisors is an integer number (594516456583).
Almost surely, 24066543266452 is an apocalyptic number.
It is an amenable number.
4066543266452 is a deficient number, since it is larger than the sum of its proper divisors (3067654212544).
4066543266452 is a wasteful number, since it uses less digits than its factorization.
4066543266452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2535251818 (or 2535251816 counting only the distinct ones).
The product of its (nonzero) digits is 24883200, while the sum is 53.
The spelling of 4066543266452 in words is "four trillion, sixty-six billion, five hundred forty-three million, two hundred sixty-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •