Base | Representation |
---|---|
bin | 101111100000001000… |
… | …1101001110111010001 |
3 | 100202022021000001201100 |
4 | 1133000101221313101 |
5 | 3132404041214301 |
6 | 114510210255013 |
7 | 10240622360601 |
oct | 1370021516721 |
9 | 322267001640 |
10 | 102010101201 |
11 | 3a298051968 |
12 | 1792ab87469 |
13 | 98090b2738 |
14 | 4d19dc8c01 |
15 | 29c0945286 |
hex | 17c0469dd1 |
102010101201 has 12 divisors (see below), whose sum is σ = 149763464500. Its totient is φ = 66891869280.
The previous prime is 102010101199. The next prime is 102010101203. The reversal of 102010101201 is 102101010201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (102010101199) and next prime (102010101203).
It can be written as a sum of positive squares in 2 ways, for example, as 971942976 + 101038158225 = 31176^2 + 317865^2 .
It is not a de Polignac number, because 102010101201 - 21 = 102010101199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102010101203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 92904826 + ... + 92905923.
Almost surely, 2102010101201 is an apocalyptic number.
It is an amenable number.
102010101201 is a deficient number, since it is larger than the sum of its proper divisors (47753363299).
102010101201 is a wasteful number, since it uses less digits than its factorization.
102010101201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185810816 (or 185810813 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102010101201 its reverse (102101010201), we get a palindrome (204111111402).
The spelling of 102010101201 in words is "one hundred two billion, ten million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •