Base | Representation |
---|---|
bin | 111100001100010111010… |
… | …111110110111101100100 |
3 | 112122102220000020012111222 |
4 | 330030113113312331210 |
5 | 1020232420040331302 |
6 | 12444131253315512 |
7 | 604563656532353 |
oct | 74142727667544 |
9 | 15572800205458 |
10 | 4136445636452 |
11 | 13552907a7878 |
12 | 569807335b98 |
13 | 2400b019881c |
14 | 1042c289b99a |
15 | 728e9b31da2 |
hex | 3c3175f6f64 |
4136445636452 has 48 divisors (see below), whose sum is σ = 7832380374000. Its totient is φ = 1904167329792.
The previous prime is 4136445636451. The next prime is 4136445636517. The reversal of 4136445636452 is 2546365446314.
It can be written as a sum of positive squares in 8 ways, for example, as 34427318116 + 4102018318336 = 185546^2 + 2025344^2 .
It is a super-2 number, since 2×41364456364522 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a junction number, because it is equal to n+sod(n) for n = 4136445636394 and 4136445636403.
It is not an unprimeable number, because it can be changed into a prime (4136445636451) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 488327 + ... + 2917422.
It is an arithmetic number, because the mean of its divisors is an integer number (163174591125).
Almost surely, 24136445636452 is an apocalyptic number.
It is an amenable number.
4136445636452 is a deficient number, since it is larger than the sum of its proper divisors (3695934737548).
4136445636452 is a wasteful number, since it uses less digits than its factorization.
4136445636452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3406160 (or 3406158 counting only the distinct ones).
The product of its digits is 24883200, while the sum is 53.
The spelling of 4136445636452 in words is "four trillion, one hundred thirty-six billion, four hundred forty-five million, six hundred thirty-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •