Base | Representation |
---|---|
bin | 11101101110001001101… |
… | …11011011001111111001 |
3 | 10121121220212222210201102 |
4 | 32313010313123033321 |
5 | 113212414242104032 |
6 | 2101045404501145 |
7 | 133531352511143 |
oct | 16670467331771 |
9 | 3547825883642 |
10 | 1021210113017 |
11 | 364102538816 |
12 | 145b0124a7b5 |
13 | 753b8598a83 |
14 | 375d9331c93 |
15 | 1b86d869362 |
hex | edc4ddb3f9 |
1021210113017 has 2 divisors, whose sum is σ = 1021210113018. Its totient is φ = 1021210113016.
The previous prime is 1021210113013. The next prime is 1021210113019. The reversal of 1021210113017 is 7103110121201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 580505324281 + 440704788736 = 761909^2 + 663856^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021210113017 - 22 = 1021210113013 is a prime.
Together with 1021210113019, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1021210113017.
It is not a weakly prime, because it can be changed into another prime (1021210113013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510605056508 + 510605056509.
It is an arithmetic number, because the mean of its divisors is an integer number (510605056509).
Almost surely, 21021210113017 is an apocalyptic number.
It is an amenable number.
1021210113017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021210113017 is an equidigital number, since it uses as much as digits as its factorization.
1021210113017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 1021210113017 its reverse (7103110121201), we get a palindrome (8124320234218).
The spelling of 1021210113017 in words is "one trillion, twenty-one billion, two hundred ten million, one hundred thirteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •