Base | Representation |
---|---|
bin | 1000110111001001011… |
… | …0000100001011001011 |
3 | 112112222000122012222212 |
4 | 2031302112010023023 |
5 | 4443243003223001 |
6 | 153534503335335 |
7 | 13666463464451 |
oct | 2156226041313 |
9 | 475860565885 |
10 | 152242242251 |
11 | 5962485aa20 |
12 | 2560975154b |
13 | 11482c81118 |
14 | 75234a69d1 |
15 | 3e608927bb |
hex | 23725842cb |
152242242251 has 16 divisors (see below), whose sum is σ = 168668172288. Its totient is φ = 136263909600.
The previous prime is 152242242211. The next prime is 152242242281.
152242242251 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 152242242251 - 226 = 152175133387 is a prime.
It is a super-2 number, since 2×1522422422512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (152242242211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 232940 + ... + 598953.
It is an arithmetic number, because the mean of its divisors is an integer number (10541760768).
Almost surely, 2152242242251 is an apocalyptic number.
152242242251 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
152242242251 is a deficient number, since it is larger than the sum of its proper divisors (16425930037).
152242242251 is a wasteful number, since it uses less digits than its factorization.
152242242251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832162.
The product of its digits is 25600, while the sum is 32.
It can be divided in two parts, 152242 and 242251, that added together give a palindrome (394493).
The spelling of 152242242251 in words is "one hundred fifty-two billion, two hundred forty-two million, two hundred forty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •