Base | Representation |
---|---|
bin | 1011101001001111110101… |
… | …1101000001101101100001 |
3 | 1200022222102211200011001112 |
4 | 2322103331131001231201 |
5 | 3134232031211140123 |
6 | 43121422315513105 |
7 | 2461001406030143 |
oct | 272237535015541 |
9 | 50288384604045 |
10 | 12803254786913 |
11 | 4096914602138 |
12 | 1529434158795 |
13 | 71b459a7ac76 |
14 | 323976310c93 |
15 | 173096d33d78 |
hex | ba4fd741b61 |
12803254786913 has 2 divisors, whose sum is σ = 12803254786914. Its totient is φ = 12803254786912.
The previous prime is 12803254786901. The next prime is 12803254786969. The reversal of 12803254786913 is 31968745230821.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12044460483169 + 758794303744 = 3470513^2 + 871088^2 .
It is a cyclic number.
It is not a de Polignac number, because 12803254786913 - 212 = 12803254782817 is a prime.
It is a super-2 number, since 2×128032547869132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12803254716913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6401627393456 + 6401627393457.
It is an arithmetic number, because the mean of its divisors is an integer number (6401627393457).
It is a 1-persistent number, because it is pandigital, but 2⋅12803254786913 = 25606509573826 is not.
Almost surely, 212803254786913 is an apocalyptic number.
It is an amenable number.
12803254786913 is a deficient number, since it is larger than the sum of its proper divisors (1).
12803254786913 is an equidigital number, since it uses as much as digits as its factorization.
12803254786913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17418240, while the sum is 59.
The spelling of 12803254786913 in words is "twelve trillion, eight hundred three billion, two hundred fifty-four million, seven hundred eighty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •