Base | Representation |
---|---|
bin | 111000110011111010… |
… | …0111000101010000101 |
3 | 102122220110101222222001 |
4 | 1301213310320222011 |
5 | 3444324224013333 |
6 | 132014012505301 |
7 | 11546204253556 |
oct | 1614764705205 |
9 | 378813358861 |
10 | 122001001093 |
11 | 47816425934 |
12 | 1b789a7b231 |
13 | b67392229a |
14 | 5c94dc232d |
15 | 32909b4b7d |
hex | 1c67d38a85 |
122001001093 has 24 divisors (see below), whose sum is σ = 128021546520. Its totient is φ = 116152957440.
The previous prime is 122001001091. The next prime is 122001001141. The reversal of 122001001093 is 390100100221.
It can be written as a sum of positive squares in 4 ways, for example, as 47789569 + 121953211524 = 6913^2 + 349218^2 .
It is not a de Polignac number, because 122001001093 - 21 = 122001001091 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 122001001093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122001001091) 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 23 ways as a sum of consecutive naturals, for example, 108060553 + ... + 108061681.
It is an arithmetic number, because the mean of its divisors is an integer number (5334231105).
Almost surely, 2122001001093 is an apocalyptic number.
It is an amenable number.
122001001093 is a deficient number, since it is larger than the sum of its proper divisors (6020545427).
122001001093 is an equidigital number, since it uses as much as digits as its factorization.
122001001093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1669 (or 1446 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
The spelling of 122001001093 in words is "one hundred twenty-two billion, one million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •