Base | Representation |
---|---|
bin | 100101010100111001100… |
… | …0110010111011101011111 |
3 | 200011102202000121121212210 |
4 | 1022221303012113131133 |
5 | 1133022442213001343 |
6 | 14524425010331503 |
7 | 1036432130341233 |
oct | 112516306273537 |
9 | 20142660547783 |
10 | 5130122000223 |
11 | 16a8744144220 |
12 | 6aa303589b93 |
13 | 2b29cb31327c |
14 | 13a42912c5c3 |
15 | 8d6a6133333 |
hex | 4aa7319775f |
5130122000223 has 16 divisors (see below), whose sum is σ = 7465527207936. Its totient is φ = 3107693360640.
The previous prime is 5130122000221. The next prime is 5130122000279. The reversal of 5130122000223 is 3220002210315.
5130122000223 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 5130122000223 - 21 = 5130122000221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5130122000223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5130122000221) 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, 36716415 + ... + 36855872.
It is an arithmetic number, because the mean of its divisors is an integer number (466595450496).
Almost surely, 25130122000223 is an apocalyptic number.
5130122000223 is a deficient number, since it is larger than the sum of its proper divisors (2335405207713).
5130122000223 is a wasteful number, since it uses less digits than its factorization.
5130122000223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73574414.
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 5130122000223 its reverse (3220002210315), we get a palindrome (8350124210538).
The spelling of 5130122000223 in words is "five trillion, one hundred thirty billion, one hundred twenty-two million, two hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •