Base | Representation |
---|---|
bin | 111010011011010011110… |
… | …100011111001001100000 |
3 | 112012211112221221210200110 |
4 | 322123103310133021200 |
5 | 1011240312110043422 |
6 | 12312253500251320 |
7 | 563035522102314 |
oct | 72332364371140 |
9 | 15184487853613 |
10 | 4015053206112 |
11 | 1308857954183 |
12 | 54a189240b40 |
13 | 2318056832a0 |
14 | dc488653b44 |
15 | 6e6927ce60c |
hex | 3a6d3d1f260 |
4015053206112 has 48 divisors (see below), whose sum is σ = 11350246566960. Its totient is φ = 1235400986112.
The previous prime is 4015053206083. The next prime is 4015053206113. The reversal of 4015053206112 is 2116023505104.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×40150532061122 (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 4015053206112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4015053206113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1608593787 + ... + 1608596282.
It is an arithmetic number, because the mean of its divisors is an integer number (236463470145).
Almost surely, 24015053206112 is an apocalyptic number.
It is an amenable number.
4015053206112 is an abundant number, since it is smaller than the sum of its proper divisors (7335193360848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4015053206112 is a wasteful number, since it uses less digits than its factorization.
4015053206112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3217190095 (or 3217190087 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The spelling of 4015053206112 in words is "four trillion, fifteen billion, fifty-three million, two hundred six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •