Base | Representation |
---|---|
bin | 101001101010010111111… |
… | …1101010101010100000001 |
3 | 202021101210111200210200001 |
4 | 1103110233331111110001 |
5 | 1222303314434402201 |
6 | 20102253010400001 |
7 | 1130455343023351 |
oct | 123245775252401 |
9 | 22241714623601 |
10 | 5725996012801 |
11 | 1908421522359 |
12 | 7858a0590001 |
13 | 326c61209aac |
14 | 15b1d5424b61 |
15 | 9de2db41301 |
hex | 5352ff55501 |
5725996012801 has 4 divisors (see below), whose sum is σ = 5726629218352. Its totient is φ = 5725362807252.
The previous prime is 5725996012771. The next prime is 5725996012823. The reversal of 5725996012801 is 1082106995275.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5725996012801 is a prime.
It is a super-3 number, since 3×57259960128013 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5725996072801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 316589211 + ... + 316607296.
It is an arithmetic number, because the mean of its divisors is an integer number (1431657304588).
Almost surely, 25725996012801 is an apocalyptic number.
It is an amenable number.
5725996012801 is a deficient number, since it is larger than the sum of its proper divisors (633205551).
5725996012801 is an equidigital number, since it uses as much as digits as its factorization.
5725996012801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 633205550.
The product of its (nonzero) digits is 2721600, while the sum is 55.
The spelling of 5725996012801 in words is "five trillion, seven hundred twenty-five billion, nine hundred ninety-six million, twelve thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •