Base | Representation |
---|---|
bin | 100110101110000010011… |
… | …0100111000111000101101 |
3 | 200211201211122121120111210 |
4 | 1031130010310320320231 |
5 | 1144142011113444401 |
6 | 15152403443305033 |
7 | 1056316600005543 |
oct | 115340464707055 |
9 | 20751748546453 |
10 | 5321545453101 |
11 | 1771944748649 |
12 | 71b42697b179 |
13 | 2c7a86815697 |
14 | 1457c8145d93 |
15 | 9365b6734d6 |
hex | 4d704d38e2d |
5321545453101 has 4 divisors (see below), whose sum is σ = 7095393937472. Its totient is φ = 3547696968732.
The previous prime is 5321545453069. The next prime is 5321545453139. The reversal of 5321545453101 is 1013545451235.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5321545453101 - 25 = 5321545453069 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5321545453101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5321545453001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 886924242181 + ... + 886924242186.
It is an arithmetic number, because the mean of its divisors is an integer number (1773848484368).
Almost surely, 25321545453101 is an apocalyptic number.
It is an amenable number.
5321545453101 is a deficient number, since it is larger than the sum of its proper divisors (1773848484371).
5321545453101 is a wasteful number, since it uses less digits than its factorization.
5321545453101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1773848484370.
The product of its (nonzero) digits is 180000, while the sum is 39.
The spelling of 5321545453101 in words is "five trillion, three hundred twenty-one billion, five hundred forty-five million, four hundred fifty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •