Base | Representation |
---|---|
bin | 111000110100100100… |
… | …1101110100100011011 |
3 | 102122222000020221202202 |
4 | 1301221021232210123 |
5 | 3444400422221021 |
6 | 132020125320415 |
7 | 11546564305106 |
oct | 1615111564433 |
9 | 378860227682 |
10 | 122023242011 |
11 | 47827a36860 |
12 | 1b79540610b |
13 | b67840b6a8 |
14 | 5c97d3173d |
15 | 3292909a0b |
hex | 1c6926e91b |
122023242011 has 8 divisors (see below), whose sum is σ = 134434248048. Its totient is φ = 109831900000.
The previous prime is 122023242001. The next prime is 122023242023. The reversal of 122023242011 is 110242320221.
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 122023242011 - 26 = 122023241947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122023242001) 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, 54914840 + ... + 54917061.
It is an arithmetic number, because the mean of its divisors is an integer number (16804281006).
Almost surely, 2122023242011 is an apocalyptic number.
122023242011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122023242011 is a deficient number, since it is larger than the sum of its proper divisors (12411006037).
122023242011 is a wasteful number, since it uses less digits than its factorization.
122023242011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109832013.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 122023242011 its reverse (110242320221), we get a palindrome (232265562232).
The spelling of 122023242011 in words is "one hundred twenty-two billion, twenty-three million, two hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •