Base | Representation |
---|---|
bin | 111000110100010001… |
… | …0101010001000011111 |
3 | 102122221021222121200021 |
4 | 1301220202222020133 |
5 | 3444340312001343 |
6 | 132015122013011 |
7 | 11546411250502 |
oct | 1615042521037 |
9 | 378837877607 |
10 | 122013000223 |
11 | 47822180a74 |
12 | 1b791aa7167 |
13 | b676263a6a |
14 | 5c96827139 |
15 | 3291a850ed |
hex | 1c688aa21f |
122013000223 has 8 divisors (see below), whose sum is σ = 126601494656. Its totient is φ = 117465292800.
The previous prime is 122013000163. The next prime is 122013000289. The reversal of 122013000223 is 322000310221.
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 122013000223 - 221 = 122010903071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122013000197 and 122013000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122013000623) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 10190658 + ... + 10202623.
It is an arithmetic number, because the mean of its divisors is an integer number (15825186832).
Almost surely, 2122013000223 is an apocalyptic number.
122013000223 is a deficient number, since it is larger than the sum of its proper divisors (4588494433).
122013000223 is a wasteful number, since it uses less digits than its factorization.
122013000223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20393505.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 122013000223 its reverse (322000310221), we get a palindrome (444013310444).
The spelling of 122013000223 in words is "one hundred twenty-two billion, thirteen million, two hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •