Base | Representation |
---|---|
bin | 100110000011100011011… |
… | …0111110101011100000110 |
3 | 200112000100102020222022220 |
4 | 1030013012313311130012 |
5 | 1141143134300143211 |
6 | 15042434432033210 |
7 | 1046610000056520 |
oct | 114070667653406 |
9 | 20460312228286 |
10 | 5230311724806 |
11 | 17371876841a3 |
12 | 705804992806 |
13 | 2bc2a721cc7c |
14 | 141211458a10 |
15 | 910bbd47806 |
hex | 4c1c6df5706 |
5230311724806 has 16 divisors (see below), whose sum is σ = 11954998228224. Its totient is φ = 1494374778504.
The previous prime is 5230311724801. The next prime is 5230311724879. The reversal of 5230311724806 is 6084271130325.
It is a super-2 number, since 2×52303117248062 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 124531231543 = 5230311724806 / (5 + 2 + 3 + 0 + 3 + 1 + 1 + 7 + 2 + 4 + 8 + 0 + 6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5230311724801) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62265615730 + ... + 62265615813.
It is an arithmetic number, because the mean of its divisors is an integer number (747187389264).
Almost surely, 25230311724806 is an apocalyptic number.
5230311724806 is an abundant number, since it is smaller than the sum of its proper divisors (6724686503418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5230311724806 is a wasteful number, since it uses less digits than its factorization.
5230311724806 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124531231555.
The product of its (nonzero) digits is 241920, while the sum is 42.
The spelling of 5230311724806 in words is "five trillion, two hundred thirty billion, three hundred eleven million, seven hundred twenty-four thousand, eight hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •