Base | Representation |
---|---|
bin | 11101011001101101000… |
… | …10100000011100100001 |
3 | 10120120120211100122110212 |
4 | 32230312202200130201 |
5 | 113022423434030032 |
6 | 2052032212503505 |
7 | 132662333056661 |
oct | 16546642403441 |
9 | 3516524318425 |
10 | 1010232330017 |
11 | 35a4898a4989 |
12 | 14395891ab95 |
13 | 7435914c9a1 |
14 | 36c773a61a1 |
15 | 1b429c17bb2 |
hex | eb368a0721 |
1010232330017 has 2 divisors, whose sum is σ = 1010232330018. Its totient is φ = 1010232330016.
The previous prime is 1010232329999. The next prime is 1010232330053. The reversal of 1010232330017 is 7100332320101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 921521281681 + 88711048336 = 959959^2 + 297844^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010232330017 is a prime.
It is a super-2 number, since 2×10102323300172 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010232329974 and 1010232330001.
It is not a weakly prime, because it can be changed into another prime (1010232330097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505116165008 + 505116165009.
It is an arithmetic number, because the mean of its divisors is an integer number (505116165009).
Almost surely, 21010232330017 is an apocalyptic number.
It is an amenable number.
1010232330017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010232330017 is an equidigital number, since it uses as much as digits as its factorization.
1010232330017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 23.
Adding to 1010232330017 its reverse (7100332320101), we get a palindrome (8110564650118).
The spelling of 1010232330017 in words is "one trillion, ten billion, two hundred thirty-two million, three hundred thirty thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •