Base | Representation |
---|---|
bin | 1011110110100001000100… |
… | …1111010011101000100001 |
3 | 1201010202212010102220211102 |
4 | 2331220101033103220201 |
5 | 3202000414310020223 |
6 | 43414243153324145 |
7 | 2513321531261363 |
oct | 275502117235041 |
9 | 51122763386742 |
10 | 13031220001313 |
11 | 4174566a70878 |
12 | 1565655266655 |
13 | 736ab9a28887 |
14 | 330a004c8d33 |
15 | 178e8a44c928 |
hex | bda113d3a21 |
13031220001313 has 4 divisors (see below), whose sum is σ = 13031471363988. Its totient is φ = 13030968638640.
The previous prime is 13031220001279. The next prime is 13031220001343. The reversal of 13031220001313 is 31310002213031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6993422562064 + 6037797439249 = 2644508^2 + 2457193^2 .
It is a cyclic number.
It is not a de Polignac number, because 13031220001313 - 212 = 13031219997217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13031220001343) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 125603558 + ... + 125707263.
It is an arithmetic number, because the mean of its divisors is an integer number (3257867840997).
Almost surely, 213031220001313 is an apocalyptic number.
It is an amenable number.
13031220001313 is a deficient number, since it is larger than the sum of its proper divisors (251362675).
13031220001313 is an equidigital number, since it uses as much as digits as its factorization.
13031220001313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251362674.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13031220001313 its reverse (31310002213031), we get a palindrome (44341222214344).
The spelling of 13031220001313 in words is "thirteen trillion, thirty-one billion, two hundred twenty million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •