Base | Representation |
---|---|
bin | 111001011011000001… |
… | …0001110101011100101 |
3 | 102210021220101122111110 |
4 | 1302312002032223211 |
5 | 4010021124401041 |
6 | 132352124055233 |
7 | 11623546146165 |
oct | 1626602165345 |
9 | 383256348443 |
10 | 123313122021 |
11 | 4832a0517a1 |
12 | 1ba95394519 |
13 | b8227122bb |
14 | 5d7b37a5a5 |
15 | 331ac9b516 |
hex | 1cb608eae5 |
123313122021 has 8 divisors (see below), whose sum is σ = 165135477280. Its totient is φ = 81849757392.
The previous prime is 123313121999. The next prime is 123313122029. The reversal of 123313122021 is 120221313321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123313122021 - 26 = 123313121957 is a prime.
It is a super-2 number, since 2×1233131220212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123313122029) 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, 89746855 + ... + 89748228.
It is an arithmetic number, because the mean of its divisors is an integer number (20641934660).
Almost surely, 2123313122021 is an apocalyptic number.
It is an amenable number.
123313122021 is a deficient number, since it is larger than the sum of its proper divisors (41822355259).
123313122021 is a wasteful number, since it uses less digits than its factorization.
123313122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179495315.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 123313122021 its reverse (120221313321), we get a palindrome (243534435342).
The spelling of 123313122021 in words is "one hundred twenty-three billion, three hundred thirteen million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •