Base | Representation |
---|---|
bin | 1011110110100100011110… |
… | …1011010110010100100111 |
3 | 1201010212012210000102022101 |
4 | 2331221013223112110213 |
5 | 3202004302112301043 |
6 | 43414513541112531 |
7 | 2513353261340104 |
oct | 275510753262447 |
9 | 51125183012271 |
10 | 13032133322023 |
11 | 4174995571182 |
12 | 156586b0b8747 |
13 | 736c0400742a |
14 | 330a89911aab |
15 | 178ee070b24d |
hex | bda47ad6527 |
13032133322023 has 8 divisors (see below), whose sum is σ = 13285668168000. Its totient is φ = 12780812754528.
The previous prime is 13032133321951. The next prime is 13032133322051. The reversal of 13032133322023 is 32022333123031.
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 13032133322023 - 233 = 13023543387431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13032133321982 and 13032133322000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032133322623) 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, 553557736 + ... + 553581277.
It is an arithmetic number, because the mean of its divisors is an integer number (1660708521000).
Almost surely, 213032133322023 is an apocalyptic number.
13032133322023 is a deficient number, since it is larger than the sum of its proper divisors (253534845977).
13032133322023 is a wasteful number, since it uses less digits than its factorization.
13032133322023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1107139241.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 13032133322023 its reverse (32022333123031), we get a palindrome (45054466445054).
The spelling of 13032133322023 in words is "thirteen trillion, thirty-two billion, one hundred thirty-three million, three hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •