Base | Representation |
---|---|
bin | 111010011000101100011… |
… | …100001111000001000001 |
3 | 112012120022020220212111100 |
4 | 322120230130033001001 |
5 | 1011214034213203010 |
6 | 12311111104005013 |
7 | 562606113150423 |
oct | 72305434170101 |
9 | 15176266825440 |
10 | 4012245053505 |
11 | 13076468085a7 |
12 | 549724900769 |
13 | 231478960320 |
14 | dc29d70a813 |
15 | 6e57aed42c0 |
hex | 3a62c70f041 |
4012245053505 has 48 divisors (see below), whose sum is σ = 7489706305536. Its totient is φ = 1975211049600.
The previous prime is 4012245053497. The next prime is 4012245053533. The reversal of 4012245053505 is 5053505422104.
4012245053505 is a `hidden beast` number, since 40 + 1 + 22 + 45 + 0 + 53 + 505 = 666.
It is not a de Polignac number, because 4012245053505 - 23 = 4012245053497 is a prime.
It is a super-2 number, since 2×40122450535052 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4012245053505.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 42863584 + ... + 42957086.
It is an arithmetic number, because the mean of its divisors is an integer number (156035548032).
Almost surely, 24012245053505 is an apocalyptic number.
4012245053505 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4012245053505 is a deficient number, since it is larger than the sum of its proper divisors (3477461252031).
4012245053505 is a wasteful number, since it uses less digits than its factorization.
4012245053505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166878 (or 166875 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
The spelling of 4012245053505 in words is "four trillion, twelve billion, two hundred forty-five million, fifty-three thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •