Base | Representation |
---|---|
bin | 1001000110001011011100… |
… | …10010111000010100001101 |
3 | 2121211022120020001112102022 |
4 | 10203011232102320110031 |
5 | 10110214143330443433 |
6 | 110313253112535525 |
7 | 4133130463150661 |
oct | 443055622702415 |
9 | 77738506045368 |
10 | 20003513140493 |
11 | 641249574a533 |
12 | 22b09940b15a5 |
13 | b214280a14ac |
14 | 4d2264a7a8a1 |
15 | 24a50d4db698 |
hex | 12316e4b850d |
20003513140493 has 2 divisors, whose sum is σ = 20003513140494. Its totient is φ = 20003513140492.
The previous prime is 20003513140447. The next prime is 20003513140519. The reversal of 20003513140493 is 39404131530002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13640294998729 + 6363218141764 = 3693277^2 + 2522542^2 .
It is a cyclic number.
It is not a de Polignac number, because 20003513140493 - 214 = 20003513124109 is a prime.
It is a super-2 number, since 2×200035131404932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20003513140433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001756570246 + 10001756570247.
It is an arithmetic number, because the mean of its divisors is an integer number (10001756570247).
Almost surely, 220003513140493 is an apocalyptic number.
It is an amenable number.
20003513140493 is a deficient number, since it is larger than the sum of its proper divisors (1).
20003513140493 is an equidigital number, since it uses as much as digits as its factorization.
20003513140493 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880, while the sum is 35.
Adding to 20003513140493 its reverse (39404131530002), we get a palindrome (59407644670495).
The spelling of 20003513140493 in words is "twenty trillion, three billion, five hundred thirteen million, one hundred forty thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •