Base | Representation |
---|---|
bin | 10010000011010… |
… | …10010100011111 |
3 | 101112221110111111 |
4 | 21001222110133 |
5 | 302231233211 |
6 | 23005402451 |
7 | 3516065065 |
oct | 1101522437 |
9 | 345843444 |
10 | 151430431 |
11 | 78529a19 |
12 | 42869427 |
13 | 254b0009 |
14 | 1617c035 |
15 | d463421 |
hex | 906a51f |
151430431 has 8 divisors (see below), whose sum is σ = 156812400. Its totient is φ = 146059200.
The previous prime is 151430417. The next prime is 151430449. The reversal of 151430431 is 134034151.
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 151430431 - 221 = 149333279 is a prime.
It is a super-3 number, since 3×1514304313 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151430471) 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 7 ways as a sum of consecutive naturals, for example, 35356 + ... + 39406.
It is an arithmetic number, because the mean of its divisors is an integer number (19601550).
Almost surely, 2151430431 is an apocalyptic number.
151430431 is a deficient number, since it is larger than the sum of its proper divisors (5381969).
151430431 is a wasteful number, since it uses less digits than its factorization.
151430431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5369.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 151430431 is about 12305.7072531407. The cubic root of 151430431 is about 533.0128994012.
Adding to 151430431 its reverse (134034151), we get a palindrome (285464582).
The spelling of 151430431 in words is "one hundred fifty-one million, four hundred thirty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •