Base | Representation |
---|---|
bin | 10111001100011100010011… |
… | …110110100111110000011001 |
3 | 111101012001220100121021010212 |
4 | 113030130103312213300121 |
5 | 101332313141420124032 |
6 | 1000542443230220505 |
7 | 30325662256435643 |
oct | 2714342366476031 |
9 | 441161810537125 |
10 | 102010101333017 |
11 | 2a55a271893a69 |
12 | b5362a8654735 |
13 | 44bc685386c37 |
14 | 1b2945b081893 |
15 | bbd7b44c4bb2 |
hex | 5cc713da7c19 |
102010101333017 has 2 divisors, whose sum is σ = 102010101333018. Its totient is φ = 102010101333016.
The previous prime is 102010101332933. The next prime is 102010101333113. The reversal of 102010101333017 is 710333101010201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96304958893081 + 5705142439936 = 9813509^2 + 2388544^2 .
It is a cyclic number.
It is not a de Polignac number, because 102010101333017 - 212 = 102010101328921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102010101332983 and 102010101333001.
It is not a weakly prime, because it can be changed into another prime (102010101333617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005050666508 + 51005050666509.
It is an arithmetic number, because the mean of its divisors is an integer number (51005050666509).
Almost surely, 2102010101333017 is an apocalyptic number.
It is an amenable number.
102010101333017 is a deficient number, since it is larger than the sum of its proper divisors (1).
102010101333017 is an equidigital number, since it uses as much as digits as its factorization.
102010101333017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 23.
Adding to 102010101333017 its reverse (710333101010201), we get a palindrome (812343202343218).
The spelling of 102010101333017 in words is "one hundred two trillion, ten billion, one hundred one million, three hundred thirty-three thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •