Base | Representation |
---|---|
bin | 10111001101000100101100… |
… | …111110101010010100001101 |
3 | 111101100012211222012001201212 |
4 | 113031010230332222110031 |
5 | 101334021002432402023 |
6 | 1001014415033544205 |
7 | 30332056120601144 |
oct | 2715045476522415 |
9 | 441305758161655 |
10 | 102053472544013 |
11 | 2a5766a87a47a1 |
12 | b542791575065 |
13 | 44c37a79c25b3 |
14 | 1b2b5b328475b |
15 | bbe9a1e28e78 |
hex | 5cd12cfaa50d |
102053472544013 has 8 divisors (see below), whose sum is σ = 107249155308768. Its totient is φ = 96986078242704.
The previous prime is 102053472543961. The next prime is 102053472544019. The reversal of 102053472544013 is 310445274350201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102053472544013 - 234 = 102036292674829 is a prime.
It is a super-2 number, since 2×1020534725440132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102053472544019) 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, 32072114231 + ... + 32072117412.
It is an arithmetic number, because the mean of its divisors is an integer number (13406144413596).
Almost surely, 2102053472544013 is an apocalyptic number.
It is an amenable number.
102053472544013 is a deficient number, since it is larger than the sum of its proper divisors (5195682764755).
102053472544013 is an equidigital number, since it uses as much as digits as its factorization.
102053472544013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64144231723.
The product of its (nonzero) digits is 403200, while the sum is 41.
The spelling of 102053472544013 in words is "one hundred two trillion, fifty-three billion, four hundred seventy-two million, five hundred forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •