Base | Representation |
---|---|
bin | 10010000000010… |
… | …11111000111011 |
3 | 101112012210221000 |
4 | 21000023320323 |
5 | 302131344033 |
6 | 22553220043 |
7 | 3512564322 |
oct | 1100137073 |
9 | 345183830 |
10 | 151043643 |
11 | 78295363 |
12 | 42701623 |
13 | 253a5c4a |
14 | 160bb0b9 |
15 | d3d8a13 |
hex | 900be3b |
151043643 has 32 divisors (see below), whose sum is σ = 228571200. Its totient is φ = 98558208.
The previous prime is 151043603. The next prime is 151043653. The reversal of 151043643 is 346340151.
151043643 is a `hidden beast` number, since 1 + 5 + 10 + 4 + 3 + 643 = 666.
It is not a de Polignac number, because 151043643 - 224 = 134266427 is a prime.
It is a super-2 number, since 2×1510436432 = 45628364181422898, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (151043603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 388093 + ... + 388481.
It is an arithmetic number, because the mean of its divisors is an integer number (7142850).
Almost surely, 2151043643 is an apocalyptic number.
151043643 is a deficient number, since it is larger than the sum of its proper divisors (77527557).
151043643 is a wasteful number, since it uses less digits than its factorization.
151043643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668 (or 662 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 151043643 is about 12289.9814076344. The cubic root of 151043643 is about 532.5587001348.
Adding to 151043643 its reverse (346340151), we get a palindrome (497383794).
The spelling of 151043643 in words is "one hundred fifty-one million, forty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •