Base | Representation |
---|---|
bin | 1001011101011111100110… |
… | …0101010111000100111101 |
3 | 1100211110011101120110210012 |
4 | 2113113321211113010331 |
5 | 2330412404101104003 |
6 | 34042430241353005 |
7 | 2122353524553506 |
oct | 227277145270475 |
9 | 40743141513705 |
10 | 10402303144253 |
11 | 3350656a34819 |
12 | 1200052338765 |
13 | 5a5c1899cbc7 |
14 | 27d68d13bbad |
15 | 1308c3b2e8d8 |
hex | 975f995713d |
10402303144253 has 2 divisors, whose sum is σ = 10402303144254. Its totient is φ = 10402303144252.
The previous prime is 10402303144231. The next prime is 10402303144349. The reversal of 10402303144253 is 35244130320401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9811315819204 + 590987325049 = 3132302^2 + 768757^2 .
It is an emirp because it is prime and its reverse (35244130320401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10402303144253 - 218 = 10402302882109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10402303144213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5201151572126 + 5201151572127.
It is an arithmetic number, because the mean of its divisors is an integer number (5201151572127).
Almost surely, 210402303144253 is an apocalyptic number.
It is an amenable number.
10402303144253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10402303144253 is an equidigital number, since it uses as much as digits as its factorization.
10402303144253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 10402303144253 its reverse (35244130320401), we get a palindrome (45646433464654).
The spelling of 10402303144253 in words is "ten trillion, four hundred two billion, three hundred three million, one hundred forty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •