Base | Representation |
---|---|
bin | 100110100101101001111… |
… | …1011001010011100010110 |
3 | 200210000101011212012000001 |
4 | 1031023103323022130112 |
5 | 1143343130024120420 |
6 | 15140225350241514 |
7 | 1055111535631522 |
oct | 115132373123426 |
9 | 20700334765001 |
10 | 5303545145110 |
11 | 1765247a75853 |
12 | 717a4265629a |
13 | 2c6178507b74 |
14 | 14499b678d82 |
15 | 92e56258b0a |
hex | 4d2d3eca716 |
5303545145110 has 16 divisors (see below), whose sum is σ = 10107933100416. Its totient is φ = 1996628760448.
The previous prime is 5303545145099. The next prime is 5303545145191. The reversal of 5303545145110 is 115415453035.
It is a super-2 number, since 2×53035451451102 (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 5303545145110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15598662022 + ... + 15598662361.
It is an arithmetic number, because the mean of its divisors is an integer number (631745818776).
Almost surely, 25303545145110 is an apocalyptic number.
5303545145110 is a deficient number, since it is larger than the sum of its proper divisors (4804387955306).
5303545145110 is a wasteful number, since it uses less digits than its factorization.
5303545145110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31197324407.
The product of its (nonzero) digits is 90000, while the sum is 37.
The spelling of 5303545145110 in words is "five trillion, three hundred three billion, five hundred forty-five million, one hundred forty-five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •