Base | Representation |
---|---|
bin | 111000111000100001… |
… | …1111110000000110111 |
3 | 102200022020222020002110 |
4 | 1301301003332000313 |
5 | 4000133410401020 |
6 | 132041225542103 |
7 | 11553065305212 |
oct | 1616103760067 |
9 | 380266866073 |
10 | 122155950135 |
11 | 4789593839a |
12 | 1b811944933 |
13 | b699a649cb |
14 | 5cab7d8779 |
15 | 329e3c08e0 |
hex | 1c710fe037 |
122155950135 has 8 divisors (see below), whose sum is σ = 195449520240. Its totient is φ = 65149840064.
The previous prime is 122155950131. The next prime is 122155950149. The reversal of 122155950135 is 531059551221.
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 122155950135 - 22 = 122155950131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122155950093 and 122155950102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122155950131) 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, 4071864990 + ... + 4071865019.
It is an arithmetic number, because the mean of its divisors is an integer number (24431190030).
Almost surely, 2122155950135 is an apocalyptic number.
122155950135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
122155950135 is a deficient number, since it is larger than the sum of its proper divisors (73293570105).
122155950135 is an equidigital number, since it uses as much as digits as its factorization.
122155950135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8143730017.
The product of its (nonzero) digits is 67500, while the sum is 39.
The spelling of 122155950135 in words is "one hundred twenty-two billion, one hundred fifty-five million, nine hundred fifty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •