Base | Representation |
---|---|
bin | 1100000111111101111000… |
… | …1111001001011000010111 |
3 | 1202012102200011001000100020 |
4 | 3001333132033021120113 |
5 | 3221403403040011043 |
6 | 44204103221120223 |
7 | 2544063622425420 |
oct | 301773617113027 |
9 | 52172604030306 |
10 | 13331012032023 |
11 | 427a717831724 |
12 | 15b3780b59073 |
13 | 75915573ca1a |
14 | 34131db72647 |
15 | 181b8472ae83 |
hex | c1fde3c9617 |
13331012032023 has 16 divisors (see below), whose sum is σ = 20335602873600. Its totient is φ = 7609591244736.
The previous prime is 13331012032003. The next prime is 13331012032043. The reversal of 13331012032023 is 32023021013331.
It is an interprime number because it is at equal distance from previous prime (13331012032003) and next prime (13331012032043).
It is not a de Polignac number, because 13331012032023 - 220 = 13331010983447 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13331012031984 and 13331012032002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331012032003) 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, 338726373 + ... + 338765726.
It is an arithmetic number, because the mean of its divisors is an integer number (1270975179600).
Almost surely, 213331012032023 is an apocalyptic number.
13331012032023 is a deficient number, since it is larger than the sum of its proper divisors (7004590841577).
13331012032023 is an equidigital number, since it uses as much as digits as its factorization.
13331012032023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 677493046.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 13331012032023 its reverse (32023021013331), we get a palindrome (45354033045354).
The spelling of 13331012032023 in words is "thirteen trillion, three hundred thirty-one billion, twelve million, thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •