Base | Representation |
---|---|
bin | 100001011111010110010… |
… | …100001100101011100001 |
3 | 22011000022201222212210112 |
4 | 201133112110030223201 |
5 | 300201233144404101 |
6 | 4521125555541105 |
7 | 325161625526315 |
oct | 41372624145341 |
9 | 8130281885715 |
10 | 2301403122401 |
11 | 808024079779 |
12 | 31203b2ba795 |
13 | 139037c95a06 |
14 | 7d5620b7b45 |
15 | 3ece894b6bb |
hex | 217d650cae1 |
2301403122401 has 4 divisors (see below), whose sum is σ = 2301407258052. Its totient is φ = 2301398986752.
The previous prime is 2301403122331. The next prime is 2301403122449. The reversal of 2301403122401 is 1042213041032.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1026728252176 + 1274674870225 = 1013276^2 + 1129015^2 .
It is a cyclic number.
It is not a de Polignac number, because 2301403122401 - 214 = 2301403106017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2301403122901) 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, 1073840 + ... + 2399153.
It is an arithmetic number, because the mean of its divisors is an integer number (575351814513).
Almost surely, 22301403122401 is an apocalyptic number.
It is an amenable number.
2301403122401 is a deficient number, since it is larger than the sum of its proper divisors (4135651).
2301403122401 is an equidigital number, since it uses as much as digits as its factorization.
2301403122401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4135650.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2301403122401 its reverse (1042213041032), we get a palindrome (3343616163433).
The spelling of 2301403122401 in words is "two trillion, three hundred one billion, four hundred three million, one hundred twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •