Base | Representation |
---|---|
bin | 111000111101100001… |
… | …0010111011010010001 |
3 | 102200201220212120201220 |
4 | 1301323002113122101 |
5 | 4001004231131113 |
6 | 132110004515253 |
7 | 11560166624502 |
oct | 1617302273221 |
9 | 380656776656 |
10 | 122323302033 |
11 | 47971351349 |
12 | 1b8599abb29 |
13 | b6c562a8ba |
14 | 5cc5b1cba9 |
15 | 32ade2b523 |
hex | 1c7b097691 |
122323302033 has 8 divisors (see below), whose sum is σ = 163120439328. Its totient is φ = 81537516384.
The previous prime is 122323302029. The next prime is 122323302053. The reversal of 122323302033 is 330203323221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122323302033 - 22 = 122323302029 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 122323301994 and 122323302012.
It is not an unprimeable number, because it can be changed into a prime (122323302053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2812735 + ... + 2855892.
It is an arithmetic number, because the mean of its divisors is an integer number (20390054916).
Almost surely, 2122323302033 is an apocalyptic number.
It is an amenable number.
122323302033 is a deficient number, since it is larger than the sum of its proper divisors (40797137295).
122323302033 is an equidigital number, since it uses as much as digits as its factorization.
122323302033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5675823.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 122323302033 its reverse (330203323221), we get a palindrome (452526625254).
The spelling of 122323302033 in words is "one hundred twenty-two billion, three hundred twenty-three million, three hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •