Base | Representation |
---|---|
bin | 11000100111111101… |
… | …10000100110111111 |
3 | 1021010022222201201222 |
4 | 30103332300212333 |
5 | 204033322333043 |
6 | 10023453023555 |
7 | 645415113614 |
oct | 142376604677 |
9 | 37108881658 |
10 | 13220121023 |
11 | 567446065a |
12 | 268b484bbb |
13 | 1328b82525 |
14 | 8d5aa850b |
15 | 525932d68 |
hex | 313fb09bf |
13220121023 has 2 divisors, whose sum is σ = 13220121024. Its totient is φ = 13220121022.
The previous prime is 13220121011. The next prime is 13220121029. The reversal of 13220121023 is 32012102231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13220121023 - 210 = 13220119999 is a prime.
It is a super-3 number, since 3×132201210233 (a number of 31 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 13220120992 and 13220121010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13220121029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610060511 + 6610060512.
It is an arithmetic number, because the mean of its divisors is an integer number (6610060512).
Almost surely, 213220121023 is an apocalyptic number.
13220121023 is a deficient number, since it is larger than the sum of its proper divisors (1).
13220121023 is an equidigital number, since it uses as much as digits as its factorization.
13220121023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 13220121023 its reverse (32012102231), we get a palindrome (45232223254).
The spelling of 13220121023 in words is "thirteen billion, two hundred twenty million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •