Base | Representation |
---|---|
bin | 100010100101010111001101… |
… | …010010110000110111000011 |
3 | 201221112201120122111211102220 |
4 | 202211113031102300313003 |
5 | 124414011044000220001 |
6 | 1255254142421142123 |
7 | 44015641400346630 |
oct | 4245271522606703 |
9 | 657481518454386 |
10 | 152101121101251 |
11 | 445117a5659103 |
12 | 1508627185a943 |
13 | 66b40c6c6b12a |
14 | 297ba3ab9d187 |
15 | 128b774c99c36 |
hex | 8a55cd4b0dc3 |
152101121101251 has 64 divisors (see below), whose sum is σ = 236689716556800. Its totient is φ = 85089001568256.
The previous prime is 152101121101247. The next prime is 152101121101297.
It is a happy number.
152101121101251 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 152101121101251 - 22 = 152101121101247 is a prime.
It is not an unprimeable number, because it can be changed into a prime (152101121101451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2129367205 + ... + 2129438633.
It is an arithmetic number, because the mean of its divisors is an integer number (3698276821200).
Almost surely, 2152101121101251 is an apocalyptic number.
152101121101251 is a deficient number, since it is larger than the sum of its proper divisors (84588595455549).
152101121101251 is a wasteful number, since it uses less digits than its factorization.
152101121101251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81788.
The product of its (nonzero) digits is 200, while the sum is 24.
The spelling of 152101121101251 in words is "one hundred fifty-two trillion, one hundred one billion, one hundred twenty-one million, one hundred one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •