Base | Representation |
---|---|
bin | 10010000000011… |
… | …01110010101001 |
3 | 101112020012121112 |
4 | 21000031302221 |
5 | 302132121213 |
6 | 22553320105 |
7 | 3512626121 |
oct | 1100156251 |
9 | 345205545 |
10 | 151051433 |
11 | 782a01a5 |
12 | 42706035 |
13 | 253a9660 |
14 | 160bdc81 |
15 | d3daea8 |
hex | 900dca9 |
151051433 has 16 divisors (see below), whose sum is σ = 167864256. Its totient is φ = 135051840.
The previous prime is 151051399. The next prime is 151051441. The reversal of 151051433 is 334150151.
It is a cyclic number.
It is not a de Polignac number, because 151051433 - 28 = 151051177 is a prime.
It is a super-2 number, since 2×1510514332 = 45633070822706978, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151051399 and 151051408.
It is not an unprimeable number, because it can be changed into a prime (151053433) 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 15 ways as a sum of consecutive naturals, for example, 51710 + ... + 54552.
It is an arithmetic number, because the mean of its divisors is an integer number (10491516).
Almost surely, 2151051433 is an apocalyptic number.
151051433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
151051433 is a deficient number, since it is larger than the sum of its proper divisors (16812823).
151051433 is a wasteful number, since it uses less digits than its factorization.
151051433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2984.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 151051433 is about 12290.2983283564. The cubic root of 151051433 is about 532.5678554599.
The spelling of 151051433 in words is "one hundred fifty-one million, fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •