Base | Representation |
---|---|
bin | 11101001100100110111… |
… | …00100010110000011001 |
3 | 10112220102210212211010222 |
4 | 32212103130202300121 |
5 | 112414023441104423 |
6 | 2044510401245425 |
7 | 132323154523223 |
oct | 16462334426031 |
9 | 3486383784128 |
10 | 1003201113113 |
11 | 357500969621 |
12 | 142516033875 |
13 | 737a8536c04 |
14 | 367ab641413 |
15 | 1b1677d43c8 |
hex | e993722c19 |
1003201113113 has 2 divisors, whose sum is σ = 1003201113114. Its totient is φ = 1003201113112.
The previous prime is 1003201113097. The next prime is 1003201113143. The reversal of 1003201113113 is 3113111023001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 896263610944 + 106937502169 = 946712^2 + 327013^2 .
It is a cyclic number.
It is not a de Polignac number, because 1003201113113 - 24 = 1003201113097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1003201113091 and 1003201113100.
It is not a weakly prime, because it can be changed into another prime (1003201113143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501600556556 + 501600556557.
It is an arithmetic number, because the mean of its divisors is an integer number (501600556557).
Almost surely, 21003201113113 is an apocalyptic number.
It is an amenable number.
1003201113113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1003201113113 is an equidigital number, since it uses as much as digits as its factorization.
1003201113113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1003201113113 its reverse (3113111023001), we get a palindrome (4116312136114).
The spelling of 1003201113113 in words is "one trillion, three billion, two hundred one million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •