Base | Representation |
---|---|
bin | 10010000111010… |
… | …11111000101011 |
3 | 101120221102111001 |
4 | 21003223320223 |
5 | 302400224011 |
6 | 23025015431 |
7 | 3523435240 |
oct | 1103537053 |
9 | 346842431 |
10 | 151961131 |
11 | 78861713 |
12 | 42a84577 |
13 | 2563773a |
14 | 162795c7 |
15 | d51a7c1 |
hex | 90ebe2b |
151961131 has 24 divisors (see below), whose sum is σ = 182617344. Its totient is φ = 123846240.
The previous prime is 151961111. The next prime is 151961141. The reversal of 151961131 is 131169151.
It is not a de Polignac number, because 151961131 - 29 = 151960619 is a prime.
It is a super-2 number, since 2×1519611312 = 46184370669598322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 151961131.
It is not an unprimeable number, because it can be changed into a prime (151961111) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 488466 + ... + 488776.
It is an arithmetic number, because the mean of its divisors is an integer number (7609056).
Almost surely, 2151961131 is an apocalyptic number.
151961131 is a deficient number, since it is larger than the sum of its proper divisors (30656213).
151961131 is an equidigital number, since it uses as much as digits as its factorization.
151961131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459 (or 430 counting only the distinct ones).
The product of its digits is 810, while the sum is 28.
The square root of 151961131 is about 12327.2515590459. The cubic root of 151961131 is about 533.6348354699.
The spelling of 151961131 in words is "one hundred fifty-one million, nine hundred sixty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •