Base | Representation |
---|---|
bin | 100101000111100100101… |
… | …0001111011100110100111 |
3 | 200001200212112002221002022 |
4 | 1022033021101323212213 |
5 | 1132040334243220401 |
6 | 14503333112133355 |
7 | 1034400000613256 |
oct | 112171121734647 |
9 | 20050775087068 |
10 | 5101503101351 |
11 | 1697598560988 |
12 | 6a485709725b |
13 | 2b00ba110797 |
14 | 138cb22b679d |
15 | 8ca7d8b971b |
hex | 4a3c947b9a7 |
5101503101351 has 16 divisors (see below), whose sum is σ = 5502390216960. Its totient is φ = 4713915165120.
The previous prime is 5101503101297. The next prime is 5101503101377. The reversal of 5101503101351 is 1531013051015.
It is a cyclic number.
It is not a de Polignac number, because 5101503101351 - 26 = 5101503101287 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 5101503101351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5101503101551) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2205470 + ... + 3881636.
It is an arithmetic number, because the mean of its divisors is an integer number (343899388560).
Almost surely, 25101503101351 is an apocalyptic number.
5101503101351 is a deficient number, since it is larger than the sum of its proper divisors (400887115609).
5101503101351 is a wasteful number, since it uses less digits than its factorization.
5101503101351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1680134.
The product of its (nonzero) digits is 1125, while the sum is 26.
Adding to 5101503101351 its reverse (1531013051015), we get a palindrome (6632516152366).
The spelling of 5101503101351 in words is "five trillion, one hundred one billion, five hundred three million, one hundred one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •