Base | Representation |
---|---|
bin | 100110101010110100010… |
… | …1000111101100101100001 |
3 | 200211001222201011221010210 |
4 | 1031111220220331211201 |
5 | 1144033330302114013 |
6 | 15145301331444333 |
7 | 1055653326413151 |
oct | 115255050754541 |
9 | 20731881157123 |
10 | 5314630113633 |
11 | 1769a16168765 |
12 | 71a016a566a9 |
13 | 2c7223c12239 |
14 | 14532d946761 |
15 | 933a44cdcc3 |
hex | 4d568a3d961 |
5314630113633 has 16 divisors (see below), whose sum is σ = 7231534675200. Its totient is φ = 3471136606080.
The previous prime is 5314630113631. The next prime is 5314630113649. The reversal of 5314630113633 is 3363110364135.
5314630113633 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5314630113633 - 21 = 5314630113631 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5314630113591 and 5314630113600.
It is not an unprimeable number, because it can be changed into a prime (5314630113631) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 91278153 + ... + 91336358.
It is an arithmetic number, because the mean of its divisors is an integer number (451970917200).
Almost surely, 25314630113633 is an apocalyptic number.
It is an amenable number.
5314630113633 is a deficient number, since it is larger than the sum of its proper divisors (1916904561567).
5314630113633 is a wasteful number, since it uses less digits than its factorization.
5314630113633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182614712.
The product of its (nonzero) digits is 174960, while the sum is 39.
Adding to 5314630113633 its reverse (3363110364135), we get a palindrome (8677740477768).
The spelling of 5314630113633 in words is "five trillion, three hundred fourteen billion, six hundred thirty million, one hundred thirteen thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •