Base | Representation |
---|---|
bin | 1001000111001111111100… |
… | …1000000100100100001001 |
3 | 1022110220202001210112002101 |
4 | 2101303333020010210021 |
5 | 2303132223333241301 |
6 | 33151105101433401 |
7 | 2052634340016421 |
oct | 221637710044411 |
9 | 38426661715071 |
10 | 10020144040201 |
11 | 32135790a4629 |
12 | 1159b79b6b861 |
13 | 578b84626439 |
14 | 268d985cb481 |
15 | 1259a8662701 |
hex | 91cff204909 |
10020144040201 has 2 divisors, whose sum is σ = 10020144040202. Its totient is φ = 10020144040200.
The previous prime is 10020144040199. The next prime is 10020144040279. The reversal of 10020144040201 is 10204044102001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9998623443600 + 21520596601 = 3162060^2 + 146699^2 .
It is a cyclic number.
It is not a de Polignac number, because 10020144040201 - 21 = 10020144040199 is a prime.
Together with 10020144040199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10020144044201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010072020100 + 5010072020101.
It is an arithmetic number, because the mean of its divisors is an integer number (5010072020101).
Almost surely, 210020144040201 is an apocalyptic number.
It is an amenable number.
10020144040201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020144040201 is an equidigital number, since it uses as much as digits as its factorization.
10020144040201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 10020144040201 its reverse (10204044102001), we get a palindrome (20224188142202).
The spelling of 10020144040201 in words is "ten trillion, twenty billion, one hundred forty-four million, forty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •