Base | Representation |
---|---|
bin | 100111000010110… |
… | …1000111000011101 |
3 | 10101022012000202001 |
4 | 1032011220320131 |
5 | 10140341213041 |
6 | 334000002301 |
7 | 44315450335 |
oct | 11605507035 |
9 | 3338160661 |
10 | 1310101021 |
11 | 612577319 |
12 | 306900391 |
13 | 17b563808 |
14 | c5dd00c5 |
15 | 7a038131 |
hex | 4e168e1d |
1310101021 has 2 divisors, whose sum is σ = 1310101022. Its totient is φ = 1310101020.
The previous prime is 1310101007. The next prime is 1310101027. The reversal of 1310101021 is 1201010131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 676572121 + 633528900 = 26011^2 + 25170^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310101021 - 25 = 1310100989 is a prime.
It is a super-3 number, since 3×13101010213 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1310100989 and 1310101007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310101027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655050510 + 655050511.
It is an arithmetic number, because the mean of its divisors is an integer number (655050511).
Almost surely, 21310101021 is an apocalyptic number.
It is an amenable number.
1310101021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310101021 is an equidigital number, since it uses as much as digits as its factorization.
1310101021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 1310101021 is about 36195.3176667922. The cubic root of 1310101021 is about 1094.2123067424.
Adding to 1310101021 its reverse (1201010131), we get a palindrome (2511111152).
The spelling of 1310101021 in words is "one billion, three hundred ten million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •