Base | Representation |
---|---|
bin | 100100101001001101010110… |
… | …1010010111010011101001101 |
3 | 1120021020210001200020020112101 |
4 | 1021102122231102322131031 |
5 | 314221420022404041023 |
6 | 3101305052545435101 |
7 | 124615032663252100 |
oct | 11122325522723515 |
9 | 1507223050206471 |
10 | 322323023112013 |
11 | 9377a47666a440 |
12 | 3019844033ba91 |
13 | 10ab0c13870701 |
14 | 598473626c737 |
15 | 273e5652091ad |
hex | 12526ad4ba74d |
322323023112013 has 24 divisors (see below), whose sum is σ = 426817354812480. Its totient is φ = 240240762558720.
The previous prime is 322323023112007. The next prime is 322323023112047. The reversal of 322323023112013 is 310211320323223.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-322323023112013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (322323023118013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13000028868 + ... + 13000053661.
It is an arithmetic number, because the mean of its divisors is an integer number (17784056450520).
Almost surely, 2322323023112013 is an apocalyptic number.
It is an amenable number.
322323023112013 is a deficient number, since it is larger than the sum of its proper divisors (104494331700467).
322323023112013 is a wasteful number, since it uses less digits than its factorization.
322323023112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26000082577 (or 26000082570 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 322323023112013 its reverse (310211320323223), we get a palindrome (632534343435236).
The spelling of 322323023112013 in words is "three hundred twenty-two trillion, three hundred twenty-three billion, twenty-three million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •