Base | Representation |
---|---|
bin | 101111100011110011… |
… | …0011110110001010101 |
3 | 100202121211021000221220 |
4 | 1133013212132301111 |
5 | 3133132022020201 |
6 | 114530320400553 |
7 | 10243644121122 |
oct | 1370746366125 |
9 | 322554230856 |
10 | 102133001301 |
11 | 3a3504645a1 |
12 | 17964176159 |
13 | 98286b36a6 |
14 | 4d2c45b749 |
15 | 29cb620036 |
hex | 17c799ec55 |
102133001301 has 8 divisors (see below), whose sum is σ = 136258933920. Its totient is φ = 68047868112.
The previous prime is 102133001293. The next prime is 102133001309. The reversal of 102133001301 is 103100331201.
It is an interprime number because it is at equal distance from previous prime (102133001293) and next prime (102133001309).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102133001301 - 23 = 102133001293 is a prime.
It is a super-2 number, since 2×1021330013012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102133001309) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10194015 + ... + 10204028.
It is an arithmetic number, because the mean of its divisors is an integer number (17032366740).
Almost surely, 2102133001301 is an apocalyptic number.
It is an amenable number.
102133001301 is a deficient number, since it is larger than the sum of its proper divisors (34125932619).
102133001301 is a wasteful number, since it uses less digits than its factorization.
102133001301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20399715.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 102133001301 its reverse (103100331201), we get a palindrome (205233332502).
The spelling of 102133001301 in words is "one hundred two billion, one hundred thirty-three million, one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •