Base | Representation |
---|---|
bin | 111000111000010111… |
… | …1110000010010101011 |
3 | 102200021220000000010002 |
4 | 1301300233300102223 |
5 | 4000131031313201 |
6 | 132040520213215 |
7 | 11553002255042 |
oct | 1616057602253 |
9 | 380256000102 |
10 | 122150651051 |
11 | 47892949090 |
12 | 1b81000a20b |
13 | b69892aa60 |
14 | 5caac19559 |
15 | 329dbc576b |
hex | 1c70bf04ab |
122150651051 has 16 divisors (see below), whose sum is σ = 143522907360. Its totient is φ = 102491723520.
The previous prime is 122150650991. The next prime is 122150651057. The reversal of 122150651051 is 150156051221.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122150651051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122150651057) 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 15 ways as a sum of consecutive naturals, for example, 1259255 + ... + 1352783.
It is an arithmetic number, because the mean of its divisors is an integer number (8970181710).
Almost surely, 2122150651051 is an apocalyptic number.
122150651051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122150651051 is a deficient number, since it is larger than the sum of its proper divisors (21372256309).
122150651051 is a wasteful number, since it uses less digits than its factorization.
122150651051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102686.
The product of its (nonzero) digits is 3000, while the sum is 29.
The spelling of 122150651051 in words is "one hundred twenty-two billion, one hundred fifty million, six hundred fifty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •