Base | Representation |
---|---|
bin | 111000110011111011… |
… | …0000111010011000001 |
3 | 102122220111000100210222 |
4 | 1301213312013103001 |
5 | 3444324314320301 |
6 | 132014023432425 |
7 | 11546210064632 |
oct | 1614766072301 |
9 | 378814010728 |
10 | 122001323201 |
11 | 4781662593a |
12 | 1b789bb5715 |
13 | b673a05a94 |
14 | 5c95067889 |
15 | 3290a2a31b |
hex | 1c67d874c1 |
122001323201 has 8 divisors (see below), whose sum is σ = 122552072064. Its totient is φ = 121450691440.
The previous prime is 122001323173. The next prime is 122001323209. The reversal of 122001323201 is 102323100221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122001323201 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 122001323201.
It is not an unprimeable number, because it can be changed into a prime (122001323209) 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, 2580491 + ... + 2627343.
It is an arithmetic number, because the mean of its divisors is an integer number (15319009008).
Almost surely, 2122001323201 is an apocalyptic number.
It is an amenable number.
122001323201 is a deficient number, since it is larger than the sum of its proper divisors (550748863).
122001323201 is a wasteful number, since it uses less digits than its factorization.
122001323201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58551.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 122001323201 its reverse (102323100221), we get a palindrome (224324423422).
The spelling of 122001323201 in words is "one hundred twenty-two billion, one million, three hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •