Base | Representation |
---|---|
bin | 10010000000011… |
… | …11001000110011 |
3 | 101112020111011202 |
4 | 21000033020303 |
5 | 302132310242 |
6 | 22553401415 |
7 | 3512651156 |
oct | 1100171063 |
9 | 345214152 |
10 | 151056947 |
11 | 782a4358 |
12 | 4270926b |
13 | 253ac012 |
14 | 160c1c9d |
15 | d3dc932 |
hex | 900f233 |
151056947 has 4 divisors (see below), whose sum is σ = 151081560. Its totient is φ = 151032336.
The previous prime is 151056937. The next prime is 151056959. The reversal of 151056947 is 749650151.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 151056947 - 28 = 151056691 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 151056947.
It is not an unprimeable number, because it can be changed into a prime (151056937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5228 + ... + 18150.
It is an arithmetic number, because the mean of its divisors is an integer number (37770390).
Almost surely, 2151056947 is an apocalyptic number.
151056947 is a deficient number, since it is larger than the sum of its proper divisors (24613).
151056947 is a wasteful number, since it uses less digits than its factorization.
151056947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24612.
The product of its (nonzero) digits is 37800, while the sum is 38.
The square root of 151056947 is about 12290.5226495866. The cubic root of 151056947 is about 532.5743356884.
The spelling of 151056947 in words is "one hundred fifty-one million, fifty-six thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •