Base | Representation |
---|---|
bin | 1101000001000101101101… |
… | …1000100110000011011100 |
3 | 1212200020201021021122011110 |
4 | 3100101123120212003130 |
5 | 3333443210214014002 |
6 | 50235002004022020 |
7 | 3005014504313562 |
oct | 320213330460334 |
9 | 55606637248143 |
10 | 14312364204252 |
11 | 461892651a604 |
12 | 17319b9991910 |
13 | 7ca85b50493a |
14 | 376a17715a32 |
15 | 19c46dcbee6c |
hex | d045b6260dc |
14312364204252 has 24 divisors (see below), whose sum is σ = 33408607695232. Its totient is φ = 4768917894000.
The previous prime is 14312364204227. The next prime is 14312364204331. The reversal of 14312364204252 is 25240246321341.
It is a super-3 number, since 3×143123642042523 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14312364204252.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 233739874 + ... + 233801097.
Almost surely, 214312364204252 is an apocalyptic number.
14312364204252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14312364204252 is an abundant number, since it is smaller than the sum of its proper divisors (19096243490980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14312364204252 is a wasteful number, since it uses less digits than its factorization.
14312364204252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467543529 (or 467543527 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 39.
The spelling of 14312364204252 in words is "fourteen trillion, three hundred twelve billion, three hundred sixty-four million, two hundred four thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •