Base | Representation |
---|---|
bin | 111010011100101001001001… |
… | …1000011001000110101001000 |
3 | 2111102022102220111112000002110 |
4 | 1310321102103003020311020 |
5 | 1014341134341403421202 |
6 | 5021230521513502320 |
7 | 213201140235456612 |
oct | 16471222303106510 |
9 | 2442272814460073 |
10 | 514110052404552 |
11 | 1398a193784090a |
12 | 497b1b804119a0 |
13 | 190b34a6932536 |
14 | 90d50b8a2ddb2 |
15 | 3e682b02e626c |
hex | 1d394930c8d48 |
514110052404552 has 16 divisors (see below), whose sum is σ = 1285275131011440. Its totient is φ = 171370017468176.
The previous prime is 514110052404541. The next prime is 514110052404601. The reversal of 514110052404552 is 255404250011415.
It is a super-3 number, since 3×5141100524045523 (a number of 45 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 514110052404552.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10710626091738 + ... + 10710626091785.
It is an arithmetic number, because the mean of its divisors is an integer number (80329695688215).
Almost surely, 2514110052404552 is an apocalyptic number.
It is an amenable number.
514110052404552 is an abundant number, since it is smaller than the sum of its proper divisors (771165078606888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
514110052404552 is a wasteful number, since it uses less digits than its factorization.
514110052404552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21421252183532 (or 21421252183528 counting only the distinct ones).
The product of its (nonzero) digits is 160000, while the sum is 39.
The spelling of 514110052404552 in words is "five hundred fourteen trillion, one hundred ten billion, fifty-two million, four hundred four thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •