Base | Representation |
---|---|
bin | 100101111101000110011… |
… | …0110100010110110011001 |
3 | 200110200120121101102221220 |
4 | 1023322030312202312121 |
5 | 1140431244032443410 |
6 | 15032223340122253 |
7 | 1045606402233144 |
oct | 113721466426631 |
9 | 20420517342856 |
10 | 5216453406105 |
11 | 1731315a56247 |
12 | 702b97836389 |
13 | 2baba90897a6 |
14 | 140698b0305b |
15 | 90a5a39e070 |
hex | 4be8cda2d99 |
5216453406105 has 8 divisors (see below), whose sum is σ = 8346325449792. Its totient is φ = 2782108483248.
The previous prime is 5216453406091. The next prime is 5216453406139. The reversal of 5216453406105 is 5016043546125.
5216453406105 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5216453406105 - 230 = 5215379664281 is a prime.
It is a super-2 number, since 2×52164534061052 (a number of 26 digits) contains 22 as substring.
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, 173881780189 + ... + 173881780218.
It is an arithmetic number, because the mean of its divisors is an integer number (1043290681224).
Almost surely, 25216453406105 is an apocalyptic number.
It is an amenable number.
5216453406105 is a deficient number, since it is larger than the sum of its proper divisors (3129872043687).
5216453406105 is a wasteful number, since it uses less digits than its factorization.
5216453406105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347763560415.
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 5216453406105 in words is "five trillion, two hundred sixteen billion, four hundred fifty-three million, four hundred six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •