Base | Representation |
---|---|
bin | 1001001001010111011100… |
… | …00100011010010000111001 |
3 | 2122012210020201020220210121 |
4 | 10210223232010122100321 |
5 | 10114012441414412213 |
6 | 110435444321013241 |
7 | 4144055441544121 |
oct | 444535604322071 |
9 | 78183221226717 |
10 | 20113031013433 |
11 | 6454985730426 |
12 | 230a059484221 |
13 | b2b85c7334c7 |
14 | 4d7693bdbc81 |
15 | 24d2bd0eb88d |
hex | 124aee11a439 |
20113031013433 has 2 divisors, whose sum is σ = 20113031013434. Its totient is φ = 20113031013432.
The previous prime is 20113031013367. The next prime is 20113031013487. The reversal of 20113031013433 is 33431013031102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20070292480144 + 42738533289 = 4479988^2 + 206733^2 .
It is a cyclic number.
It is not a de Polignac number, because 20113031013433 - 241 = 17914007757881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20113031013398 and 20113031013407.
It is not a weakly prime, because it can be changed into another prime (20113031013533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056515506716 + 10056515506717.
It is an arithmetic number, because the mean of its divisors is an integer number (10056515506717).
Almost surely, 220113031013433 is an apocalyptic number.
It is an amenable number.
20113031013433 is a deficient number, since it is larger than the sum of its proper divisors (1).
20113031013433 is an equidigital number, since it uses as much as digits as its factorization.
20113031013433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 20113031013433 its reverse (33431013031102), we get a palindrome (53544044044535).
The spelling of 20113031013433 in words is "twenty trillion, one hundred thirteen billion, thirty-one million, thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •