Base | Representation |
---|---|
bin | 1000111000010100010… |
… | …1011101001010010011 |
3 | 112120202221021001112210 |
4 | 2032011011131022103 |
5 | 4444414000432001 |
6 | 154030014323203 |
7 | 14010332113440 |
oct | 2160505351223 |
9 | 476687231483 |
10 | 152556655251 |
11 | 59776289080 |
12 | 25696ab9503 |
13 | 11503157310 |
14 | 755314c9c7 |
15 | 3e7d29bdd6 |
hex | 238515d293 |
152556655251 has 64 divisors (see below), whose sum is σ = 282526110720. Its totient is φ = 70631447040.
The previous prime is 152556655133. The next prime is 152556655313.
152556655251 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 152556655251 - 214 = 152556638867 is a prime.
It is a super-2 number, since 2×1525566552512 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 152556655251.
It is not an unprimeable number, because it can be changed into a prime (152556655451) 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 63 ways as a sum of consecutive naturals, for example, 788800 + ... + 962973.
It is an arithmetic number, because the mean of its divisors is an integer number (4414470480).
Almost surely, 2152556655251 is an apocalyptic number.
152556655251 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
152556655251 is a deficient number, since it is larger than the sum of its proper divisors (129969455469).
152556655251 is a wasteful number, since it uses less digits than its factorization.
152556655251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1751836.
The product of its digits is 2250000, while the sum is 48.
The spelling of 152556655251 in words is "one hundred fifty-two billion, five hundred fifty-six million, six hundred fifty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •