Base | Representation |
---|---|
bin | 1000110011011000000… |
… | …1101001000110010111 |
3 | 112110100111101222011111 |
4 | 2030312001221012113 |
5 | 4434204421134021 |
6 | 153250233115451 |
7 | 13632424651006 |
oct | 2146601510627 |
9 | 473314358144 |
10 | 151230255511 |
11 | 5915559a345 |
12 | 25386858b87 |
13 | 11351407cba |
14 | 7468d18c3d |
15 | 3e01ae48e1 |
hex | 2336069197 |
151230255511 has 8 divisors (see below), whose sum is σ = 164453887440. Its totient is φ = 138487483008.
The previous prime is 151230255499. The next prime is 151230255551. The reversal of 151230255511 is 115552032151.
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 151230255511 - 25 = 151230255479 is a prime.
It is a super-2 number, since 2×1512302555112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151230255551) 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 7 ways as a sum of consecutive naturals, for example, 120214201 + ... + 120215458.
It is an arithmetic number, because the mean of its divisors is an integer number (20556735930).
Almost surely, 2151230255511 is an apocalyptic number.
151230255511 is a deficient number, since it is larger than the sum of its proper divisors (13223631929).
151230255511 is a wasteful number, since it uses less digits than its factorization.
151230255511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240429713.
The product of its (nonzero) digits is 7500, while the sum is 31.
Adding to 151230255511 its reverse (115552032151), we get a palindrome (266782287662).
The spelling of 151230255511 in words is "one hundred fifty-one billion, two hundred thirty million, two hundred fifty-five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •