Base | Representation |
---|---|
bin | 111010001110100110110… |
… | …100110011100110110101 |
3 | 112011112100101021112110221 |
4 | 322032212310303212311 |
5 | 1011024343313211201 |
6 | 12302120212214341 |
7 | 562043516552443 |
oct | 72164664634665 |
9 | 15145311245427 |
10 | 4001413413301 |
11 | 1302a98611a37 |
12 | 54760130a3b1 |
13 | 230440892575 |
14 | db952d43b93 |
15 | 6e1450ee4a1 |
hex | 3a3a6d339b5 |
4001413413301 has 2 divisors, whose sum is σ = 4001413413302. Its totient is φ = 4001413413300.
The previous prime is 4001413413191. The next prime is 4001413413331. The reversal of 4001413413301 is 1033143141004.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4001304106276 + 109307025 = 2000326^2 + 10455^2 .
It is a cyclic number.
It is not a de Polignac number, because 4001413413301 - 215 = 4001413380533 is a prime.
It is a super-2 number, since 2×40014134133012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4001413413331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2000706706650 + 2000706706651.
It is an arithmetic number, because the mean of its divisors is an integer number (2000706706651).
Almost surely, 24001413413301 is an apocalyptic number.
It is an amenable number.
4001413413301 is a deficient number, since it is larger than the sum of its proper divisors (1).
4001413413301 is an equidigital number, since it uses as much as digits as its factorization.
4001413413301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 4001413413301 its reverse (1033143141004), we get a palindrome (5034556554305).
The spelling of 4001413413301 in words is "four trillion, one billion, four hundred thirteen million, four hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •