Base | Representation |
---|---|
bin | 100100011111011100111… |
… | …0011000011001111010001 |
3 | 122202110110221120012010121 |
4 | 1020332321303003033101 |
5 | 1124132411031031001 |
6 | 14400003415430241 |
7 | 1025226620424634 |
oct | 110767163031721 |
9 | 18673427505117 |
10 | 5015344002001 |
11 | 1663aa4a37353 |
12 | 690010685381 |
13 | 2a4c38c763a8 |
14 | 134a5b555c1b |
15 | 8a6d98376a1 |
hex | 48fb9cc33d1 |
5015344002001 has 2 divisors, whose sum is σ = 5015344002002. Its totient is φ = 5015344002000.
The previous prime is 5015344001999. The next prime is 5015344002049. The reversal of 5015344002001 is 1002004435105.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3992707326976 + 1022636675025 = 1998176^2 + 1011255^2 .
It is a cyclic number.
It is not a de Polignac number, because 5015344002001 - 21 = 5015344001999 is a prime.
Together with 5015344001999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5015344002061) 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 as a sum of consecutive naturals, namely, 2507672001000 + 2507672001001.
It is an arithmetic number, because the mean of its divisors is an integer number (2507672001001).
Almost surely, 25015344002001 is an apocalyptic number.
It is an amenable number.
5015344002001 is a deficient number, since it is larger than the sum of its proper divisors (1).
5015344002001 is an equidigital number, since it uses as much as digits as its factorization.
5015344002001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 5015344002001 its reverse (1002004435105), we get a palindrome (6017348437106).
The spelling of 5015344002001 in words is "five trillion, fifteen billion, three hundred forty-four million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •