Base | Representation |
---|---|
bin | 111000110100100100… |
… | …1100111010100100010 |
3 | 102122222000012110001011 |
4 | 1301221021213110202 |
5 | 3444400420243242 |
6 | 132020124531134 |
7 | 11546564122414 |
oct | 1615111472442 |
9 | 378860173034 |
10 | 122023212322 |
11 | 47827a16520 |
12 | 1b7953b0aaa |
13 | b6783cb01b |
14 | 5c97d249b4 |
15 | 3292900d17 |
hex | 1c69267522 |
122023212322 has 8 divisors (see below), whose sum is σ = 199674347472. Its totient is φ = 55465096500.
The previous prime is 122023212313. The next prime is 122023212379. The reversal of 122023212322 is 223212320221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 5546509651 = 122023212322 / (1 + 2 + 2 + 0 + 2 + 3 + 2 + 1 + 2 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 122023212293 and 122023212302.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2773254804 + ... + 2773254847.
It is an arithmetic number, because the mean of its divisors is an integer number (24959293434).
Almost surely, 2122023212322 is an apocalyptic number.
122023212322 is a deficient number, since it is larger than the sum of its proper divisors (77651135150).
122023212322 is a wasteful number, since it uses less digits than its factorization.
122023212322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5546509664.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 122023212322 its reverse (223212320221), we get a palindrome (345235532543).
The spelling of 122023212322 in words is "one hundred twenty-two billion, twenty-three million, two hundred twelve thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •