Base | Representation |
---|---|
bin | 101111100000001110… |
… | …1011110101001101001 |
3 | 100202022110211112211202 |
4 | 1133000131132221221 |
5 | 3132410334413001 |
6 | 114510400533545 |
7 | 10240660621115 |
oct | 1370035365151 |
9 | 322273745752 |
10 | 102013201001 |
11 | 3a299879888 |
12 | 179300212b5 |
13 | 980992963a |
14 | 4d1a594745 |
15 | 29c0d5896b |
hex | 17c075ea69 |
102013201001 has 4 divisors (see below), whose sum is σ = 102451026132. Its totient is φ = 101575375872.
The previous prime is 102013200967. The next prime is 102013201007. The reversal of 102013201001 is 100102310201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100102310201 = 41 ⋅2441519761.
It can be written as a sum of positive squares in 2 ways, for example, as 65701992976 + 36311208025 = 256324^2 + 190555^2 .
It is a cyclic number.
It is not a de Polignac number, because 102013201001 - 226 = 101946092137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102013201007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 218912216 + ... + 218912681.
It is an arithmetic number, because the mean of its divisors is an integer number (25612756533).
Almost surely, 2102013201001 is an apocalyptic number.
It is an amenable number.
102013201001 is a deficient number, since it is larger than the sum of its proper divisors (437825131).
102013201001 is an equidigital number, since it uses as much as digits as its factorization.
102013201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 437825130.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 102013201001 its reverse (100102310201), we get a palindrome (202115511202).
The spelling of 102013201001 in words is "one hundred two billion, thirteen million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •