Base | Representation |
---|---|
bin | 1001001111001011111011… |
… | …11011010001100100011001 |
3 | 2122220220102210201010002222 |
4 | 10213211331323101210121 |
5 | 10130302022314030431 |
6 | 111111400325433425 |
7 | 4164365253633545 |
oct | 447457573214431 |
9 | 78826383633088 |
10 | 20313013033241 |
11 | 6521778330865 |
12 | 234096ab6b875 |
13 | b446800c86c6 |
14 | 50322575ca25 |
15 | 2535c4bbd57b |
hex | 12797ded1919 |
20313013033241 has 2 divisors, whose sum is σ = 20313013033242. Its totient is φ = 20313013033240.
The previous prime is 20313013033237. The next prime is 20313013033259. The reversal of 20313013033241 is 14233031031302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12568591938841 + 7744421094400 = 3545221^2 + 2782880^2 .
It is a cyclic number.
It is not a de Polignac number, because 20313013033241 - 22 = 20313013033237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20313013033241.
It is not a weakly prime, because it can be changed into another prime (20313013033211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10156506516620 + 10156506516621.
It is an arithmetic number, because the mean of its divisors is an integer number (10156506516621).
Almost surely, 220313013033241 is an apocalyptic number.
It is an amenable number.
20313013033241 is a deficient number, since it is larger than the sum of its proper divisors (1).
20313013033241 is an equidigital number, since it uses as much as digits as its factorization.
20313013033241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 20313013033241 its reverse (14233031031302), we get a palindrome (34546044064543).
The spelling of 20313013033241 in words is "twenty trillion, three hundred thirteen billion, thirteen million, thirty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •