Base | Representation |
---|---|
bin | 101011001001010111110… |
… | …0100011010100101101101 |
3 | 202222220100220222211021021 |
4 | 1112102233210122211231 |
5 | 1234124120102133443 |
6 | 20340112105134141 |
7 | 1151266636651411 |
oct | 126225744324555 |
9 | 22886326884237 |
10 | 5930000427373 |
11 | 1986998712490 |
12 | 7b933518a351 |
13 | 340273034b39 |
14 | 167029288d41 |
15 | a43bd90d9ed |
hex | 564af91a96d |
5930000427373 has 8 divisors (see below), whose sum is σ = 6606731617920. Its totient is φ = 5276209277280.
The previous prime is 5930000427343. The next prime is 5930000427383. The reversal of 5930000427373 is 3737240000395.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5930000427373 is a prime.
It is a super-2 number, since 2×59300004273732 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5930000427343) 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 7 ways as a sum of consecutive naturals, for example, 5735009568 + ... + 5735010601.
It is an arithmetic number, because the mean of its divisors is an integer number (825841452240).
Almost surely, 25930000427373 is an apocalyptic number.
It is an amenable number.
5930000427373 is a deficient number, since it is larger than the sum of its proper divisors (676731190547).
5930000427373 is a wasteful number, since it uses less digits than its factorization.
5930000427373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11470020227.
The product of its (nonzero) digits is 476280, while the sum is 43.
The spelling of 5930000427373 in words is "five trillion, nine hundred thirty billion, four hundred twenty-seven thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •