Base | Representation |
---|---|
bin | 1110100010110… |
… | …11110101111001 |
3 | 22111120210121222 |
4 | 13101123311321 |
5 | 222213323001 |
6 | 20035041425 |
7 | 3011035130 |
oct | 721336571 |
9 | 274523558 |
10 | 122011001 |
11 | 62965742 |
12 | 34a40275 |
13 | 1c37c378 |
14 | 122c0917 |
15 | aaa161b |
hex | 745bd79 |
122011001 has 8 divisors (see below), whose sum is σ = 139596864. Its totient is φ = 104464080.
The previous prime is 122010983. The next prime is 122011031. The reversal of 122011001 is 100110221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122011001 - 210 = 122009977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122011001.
It is not an unprimeable number, because it can be changed into a prime (122011031) 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, 2675 + ... + 15848.
It is an arithmetic number, because the mean of its divisors is an integer number (17449608).
Almost surely, 2122011001 is an apocalyptic number.
It is an amenable number.
122011001 is a deficient number, since it is larger than the sum of its proper divisors (17585863).
122011001 is an equidigital number, since it uses as much as digits as its factorization.
122011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19471.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 122011001 is about 11045.8589978326. The cubic root of 122011001 is about 495.9824734203.
Adding to 122011001 its reverse (100110221), we get a palindrome (222121222).
It can be divided in two parts, 1220 and 11001, that added together give a palindrome (12221).
The spelling of 122011001 in words is "one hundred twenty-two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •