Base | Representation |
---|---|
bin | 10011000100000010000… |
… | …101110101101000010111 |
3 | 11122020100011022200101102 |
4 | 103010002011311220113 |
5 | 132430340012010403 |
6 | 2441450012420315 |
7 | 163434011132336 |
oct | 23040205655027 |
9 | 4566304280342 |
10 | 1310000110103 |
11 | 465627a019a3 |
12 | 191a7847769b |
13 | 966bcb22a59 |
14 | 47593739d1d |
15 | 24121d05b88 |
hex | 13102175a17 |
1310000110103 has 2 divisors, whose sum is σ = 1310000110104. Its totient is φ = 1310000110102.
The previous prime is 1310000110093. The next prime is 1310000110127. The reversal of 1310000110103 is 3010110000131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1310000110103 - 24 = 1310000110087 is a prime.
It is a super-2 number, since 2×13100001101032 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310000110303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655000055051 + 655000055052.
It is an arithmetic number, because the mean of its divisors is an integer number (655000055052).
Almost surely, 21310000110103 is an apocalyptic number.
1310000110103 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310000110103 is an equidigital number, since it uses as much as digits as its factorization.
1310000110103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 1310000110103 its reverse (3010110000131), we get a palindrome (4320110110234).
The spelling of 1310000110103 in words is "one trillion, three hundred ten billion, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •