Base | Representation |
---|---|
bin | 1011110110100001001000… |
… | …0001010100000100101001 |
3 | 1201010202220001002220222221 |
4 | 2331220102001110010221 |
5 | 3202000431134012223 |
6 | 43414244342314041 |
7 | 2513322050560135 |
oct | 275502201240451 |
9 | 51122801086887 |
10 | 13031233110313 |
11 | 4174573404860 |
12 | 1565659728921 |
13 | 736abc668592 |
14 | 330a0213c3c5 |
15 | 178e8b68bb5d |
hex | bda12054129 |
13031233110313 has 8 divisors (see below), whose sum is σ = 14964095437920. Its totient is φ = 11223071578080.
The previous prime is 13031233110299. The next prime is 13031233110319. The reversal of 13031233110313 is 31301133213031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13031233110313 - 217 = 13031232979241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13031233110319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31175198620 + ... + 31175199037.
It is an arithmetic number, because the mean of its divisors is an integer number (1870511929740).
Almost surely, 213031233110313 is an apocalyptic number.
It is an amenable number.
13031233110313 is a deficient number, since it is larger than the sum of its proper divisors (1932862327607).
13031233110313 is a wasteful number, since it uses less digits than its factorization.
13031233110313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62350397687.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 13031233110313 its reverse (31301133213031), we get a palindrome (44332366323344).
The spelling of 13031233110313 in words is "thirteen trillion, thirty-one billion, two hundred thirty-three million, one hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •