Base | Representation |
---|---|
bin | 101111100011101101… |
… | …1100100001101100001 |
3 | 100202121121212122222211 |
4 | 1133013123210031201 |
5 | 3133130303440001 |
6 | 114530135202121 |
7 | 10243610603131 |
oct | 1370733441541 |
9 | 322547778884 |
10 | 102130140001 |
11 | 3a34988a88a |
12 | 17963216341 |
13 | 9827c21206 |
14 | 4d2bd14ac1 |
15 | 29cb257351 |
hex | 17c76e4361 |
102130140001 has 4 divisors (see below), whose sum is σ = 102456434692. Its totient is φ = 101803845312.
The previous prime is 102130139989. The next prime is 102130140011. The reversal of 102130140001 is 100041031201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100041031201 = 4993 ⋅20036257.
It can be written as a sum of positive squares in 2 ways, for example, as 24704294976 + 77425845025 = 157176^2 + 278255^2 .
It is a cyclic number.
It is not a de Polignac number, because 102130140001 - 211 = 102130137953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102130140011) 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, 163146876 + ... + 163147501.
It is an arithmetic number, because the mean of its divisors is an integer number (25614108673).
Almost surely, 2102130140001 is an apocalyptic number.
It is an amenable number.
102130140001 is a deficient number, since it is larger than the sum of its proper divisors (326294691).
102130140001 is an equidigital number, since it uses as much as digits as its factorization.
102130140001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326294690.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 102130140001 its reverse (100041031201), we get a palindrome (202171171202).
The spelling of 102130140001 in words is "one hundred two billion, one hundred thirty million, one hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •