Base | Representation |
---|---|
bin | 1001010001110001110101… |
… | …0111111011100010100011 |
3 | 1100010012200000201112210012 |
4 | 2110130131113323202203 |
5 | 2314113212233443301 |
6 | 33410143152555135 |
7 | 2102000166343616 |
oct | 224343527734243 |
9 | 40105600645705 |
10 | 10201040140451 |
11 | 3283267245126 |
12 | 1189043852aab |
13 | 58cc52aca304 |
14 | 273a3940a17d |
15 | 12a544876ebb |
hex | 9471d5fb8a3 |
10201040140451 has 2 divisors, whose sum is σ = 10201040140452. Its totient is φ = 10201040140450.
The previous prime is 10201040140439. The next prime is 10201040140453. The reversal of 10201040140451 is 15404104010201.
It is a strong prime.
It is an emirp because it is prime and its reverse (15404104010201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10201040140451 is a prime.
It is a super-2 number, since 2×102010401404512 (a number of 27 digits) contains 22 as substring.
Together with 10201040140453, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10201040140453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100520070225 + 5100520070226.
It is an arithmetic number, because the mean of its divisors is an integer number (5100520070226).
Almost surely, 210201040140451 is an apocalyptic number.
10201040140451 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201040140451 is an equidigital number, since it uses as much as digits as its factorization.
10201040140451 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 640, while the sum is 23.
Adding to 10201040140451 its reverse (15404104010201), we get a palindrome (25605144150652).
The spelling of 10201040140451 in words is "ten trillion, two hundred one billion, forty million, one hundred forty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •