Base | Representation |
---|---|
bin | 1011101110010001100… |
… | …0001001111011110101 |
3 | 201020211220200201201222 |
4 | 2323210120021323311 |
5 | 11244431402024023 |
6 | 232304421400125 |
7 | 20356611014624 |
oct | 2734430117365 |
9 | 636756621658 |
10 | 201400033013 |
11 | 78460082783 |
12 | 33048569045 |
13 | 15cb83ac98a |
14 | 9a680016bb |
15 | 538b323cc8 |
hex | 2ee4609ef5 |
201400033013 has 2 divisors, whose sum is σ = 201400033014. Its totient is φ = 201400033012.
The previous prime is 201400032989. The next prime is 201400033103. The reversal of 201400033013 is 310330004102.
It is a happy number.
Together with next prime (201400033103) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 177256156324 + 24143876689 = 421018^2 + 155383^2 .
It is a cyclic number.
It is not a de Polignac number, because 201400033013 - 26 = 201400032949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201400032982 and 201400033000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201400033313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100700016506 + 100700016507.
It is an arithmetic number, because the mean of its divisors is an integer number (100700016507).
Almost surely, 2201400033013 is an apocalyptic number.
It is an amenable number.
201400033013 is a deficient number, since it is larger than the sum of its proper divisors (1).
201400033013 is an equidigital number, since it uses as much as digits as its factorization.
201400033013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 201400033013 its reverse (310330004102), we get a palindrome (511730037115).
The spelling of 201400033013 in words is "two hundred one billion, four hundred million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •