Base | Representation |
---|---|
bin | 1011110101111011011010… |
… | …1000110000110100101111 |
3 | 1201002210202112201022102101 |
4 | 2331132312220300310233 |
5 | 3201314213130410411 |
6 | 43405452041235531 |
7 | 2512513146634435 |
oct | 275366650606457 |
9 | 51083675638371 |
10 | 13021110013231 |
11 | 4170249163121 |
12 | 15636b3492ba7 |
13 | 735b6830b5c8 |
14 | 3303218d4d55 |
15 | 178a97ab58c1 |
hex | bd7b6a30d2f |
13021110013231 has 2 divisors, whose sum is σ = 13021110013232. Its totient is φ = 13021110013230.
The previous prime is 13021110013199. The next prime is 13021110013237. The reversal of 13021110013231 is 13231001112031.
It is a strong prime.
It is an emirp because it is prime and its reverse (13231001112031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13021110013231 - 25 = 13021110013199 is a prime.
It is a super-2 number, since 2×130211100132312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13021110013199 and 13021110013208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13021110013237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510555006615 + 6510555006616.
It is an arithmetic number, because the mean of its divisors is an integer number (6510555006616).
Almost surely, 213021110013231 is an apocalyptic number.
13021110013231 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021110013231 is an equidigital number, since it uses as much as digits as its factorization.
13021110013231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13021110013231 its reverse (13231001112031), we get a palindrome (26252111125262).
The spelling of 13021110013231 in words is "thirteen trillion, twenty-one billion, one hundred ten million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •