Base | Representation |
---|---|
bin | 11011010100001000111010… |
… | …001010001101001100101101 |
3 | 120202100102122122110122000111 |
4 | 123110020322022031030231 |
5 | 111221212210010220044 |
6 | 1103255303320300021 |
7 | 34206123253400224 |
oct | 3324107212151455 |
9 | 522312578418014 |
10 | 120131211023149 |
11 | 353063a6898a17 |
12 | 11582297611611 |
13 | 520542b185141 |
14 | 219454b2d7cbb |
15 | dd4d4d980b34 |
hex | 6d423a28d32d |
120131211023149 has 2 divisors, whose sum is σ = 120131211023150. Its totient is φ = 120131211023148.
The previous prime is 120131211023099. The next prime is 120131211023177. The reversal of 120131211023149 is 941320112131021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114827448083049 + 5303762940100 = 10715757^2 + 2302990^2 .
It is a cyclic number.
It is not a de Polignac number, because 120131211023149 - 239 = 119581455209261 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120131211023149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120131211623149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60065605511574 + 60065605511575.
It is an arithmetic number, because the mean of its divisors is an integer number (60065605511575).
Almost surely, 2120131211023149 is an apocalyptic number.
It is an amenable number.
120131211023149 is a deficient number, since it is larger than the sum of its proper divisors (1).
120131211023149 is an equidigital number, since it uses as much as digits as its factorization.
120131211023149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 31.
The spelling of 120131211023149 in words is "one hundred twenty trillion, one hundred thirty-one billion, two hundred eleven million, twenty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •