Base | Representation |
---|---|
bin | 1011110110100001000010… |
… | …1110000111100100001101 |
3 | 1201010202211112001220102112 |
4 | 2331220100232013210031 |
5 | 3202000410043114013 |
6 | 43414242243033405 |
7 | 2513321364314414 |
oct | 275502056074415 |
9 | 51122745056375 |
10 | 13031211301133 |
11 | 4174562069243 |
12 | 156565236b865 |
13 | 736ab7ca083c |
14 | 3309dd2a247b |
15 | 178e897ceba8 |
hex | bda10b8790d |
13031211301133 has 8 divisors (see below), whose sum is σ = 13045397123616. Its totient is φ = 13017028878000.
The previous prime is 13031211301117. The next prime is 13031211301181. The reversal of 13031211301133 is 33110311213031.
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 13031211301133 - 24 = 13031211301117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13031211301099 and 13031211301108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031211301183) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6859235 + ... + 8550527.
It is an arithmetic number, because the mean of its divisors is an integer number (1630674640452).
Almost surely, 213031211301133 is an apocalyptic number.
It is an amenable number.
13031211301133 is a deficient number, since it is larger than the sum of its proper divisors (14185822483).
13031211301133 is a wasteful number, since it uses less digits than its factorization.
13031211301133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1699675.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13031211301133 its reverse (33110311213031), we get a palindrome (46141522514164).
The spelling of 13031211301133 in words is "thirteen trillion, thirty-one billion, two hundred eleven million, three hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •