Base | Representation |
---|---|
bin | 100101111010010011000… |
… | …0101101001100001000111 |
3 | 200110010001010110110101222 |
4 | 1023310212011221201013 |
5 | 1140331432143020111 |
6 | 15025350202510555 |
7 | 1045304264116136 |
oct | 113644605514107 |
9 | 20403033413358 |
10 | 5210434345031 |
11 | 1729807396603 |
12 | 701997b0545b |
13 | 2ba45a078aa6 |
14 | 14028757191d |
15 | 90806c4d7db |
hex | 4bd26169847 |
5210434345031 has 16 divisors (see below), whose sum is σ = 5757904440000. Its totient is φ = 4689821165568.
The previous prime is 5210434345027. The next prime is 5210434345087. The reversal of 5210434345031 is 1305434340125.
It is a cyclic number.
It is not a de Polignac number, because 5210434345031 - 22 = 5210434345027 is a prime.
It is a super-2 number, since 2×52104343450312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5210434344982 and 5210434345000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5210434345021) 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, 757595 + ... + 3315843.
It is an arithmetic number, because the mean of its divisors is an integer number (359869027500).
Almost surely, 25210434345031 is an apocalyptic number.
5210434345031 is a deficient number, since it is larger than the sum of its proper divisors (547470094969).
5210434345031 is a wasteful number, since it uses less digits than its factorization.
5210434345031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2563498.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 5210434345031 its reverse (1305434340125), we get a palindrome (6515868685156).
The spelling of 5210434345031 in words is "five trillion, two hundred ten billion, four hundred thirty-four million, three hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •