Base | Representation |
---|---|
bin | 1100001000100000111100… |
… | …1011010011100010011111 |
3 | 1202020022222000111220201220 |
4 | 3002020033023103202133 |
5 | 3222032141244340411 |
6 | 44212301123504423 |
7 | 2544546055622034 |
oct | 302101713234237 |
9 | 52208860456656 |
10 | 13340423043231 |
11 | 4283707029739 |
12 | 15b5568828113 |
13 | 759cc53b84cb |
14 | 3419739b738b |
15 | 182035a43b06 |
hex | c220f2d389f |
13340423043231 has 16 divisors (see below), whose sum is σ = 18362268487680. Its totient is φ = 8606135734560.
The previous prime is 13340423043151. The next prime is 13340423043239. The reversal of 13340423043231 is 13234032404331.
It is a happy number.
It is not a de Polignac number, because 13340423043231 - 29 = 13340423042719 is a prime.
It is a super-2 number, since 2×133404230432312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13340423043192 and 13340423043201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13340423043239) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3538000 + ... + 6260853.
It is an arithmetic number, because the mean of its divisors is an integer number (1147641780480).
Almost surely, 213340423043231 is an apocalyptic number.
13340423043231 is a deficient number, since it is larger than the sum of its proper divisors (5021845444449).
13340423043231 is a wasteful number, since it uses less digits than its factorization.
13340423043231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9813526.
The product of its (nonzero) digits is 62208, while the sum is 33.
Adding to 13340423043231 its reverse (13234032404331), we get a palindrome (26574455447562).
The spelling of 13340423043231 in words is "thirteen trillion, three hundred forty billion, four hundred twenty-three million, forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •