Base | Representation |
---|---|
bin | 1001001110010011101110… |
… | …0011110001111101110101 |
3 | 1022220111202210022021100222 |
4 | 2103210323203301331311 |
5 | 2312124110224140201 |
6 | 33322522550344125 |
7 | 2064456524241116 |
oct | 223447343617565 |
9 | 38814683267328 |
10 | 10141417021301 |
11 | 325aa50582245 |
12 | 117958405b045 |
13 | 587440478657 |
14 | 270bc0a2020d |
15 | 128c0526c91b |
hex | 9393b8f1f75 |
10141417021301 has 2 divisors, whose sum is σ = 10141417021302. Its totient is φ = 10141417021300.
The previous prime is 10141417021289. The next prime is 10141417021303. The reversal of 10141417021301 is 10312071414101.
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., 8791640104900 + 1349776916401 = 2965070^2 + 1161799^2 .
It is a cyclic number.
It is not a de Polignac number, because 10141417021301 - 210 = 10141417020277 is a prime.
Together with 10141417021303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10141417021303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070708510650 + 5070708510651.
It is an arithmetic number, because the mean of its divisors is an integer number (5070708510651).
Almost surely, 210141417021301 is an apocalyptic number.
It is an amenable number.
10141417021301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10141417021301 is an equidigital number, since it uses as much as digits as its factorization.
10141417021301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 26.
Adding to 10141417021301 its reverse (10312071414101), we get a palindrome (20453488435402).
The spelling of 10141417021301 in words is "ten trillion, one hundred forty-one billion, four hundred seventeen million, twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •