Base | Representation |
---|---|
bin | 10010000011001… |
… | …01111100110011 |
3 | 101112220112221112 |
4 | 21001211330303 |
5 | 302230200111 |
6 | 23005143535 |
7 | 3515661644 |
oct | 1101457463 |
9 | 345815845 |
10 | 151412531 |
11 | 78517526 |
12 | 4285abab |
13 | 254a4b1a |
14 | 161756cb |
15 | d45ce8b |
hex | 9065f33 |
151412531 has 2 divisors, whose sum is σ = 151412532. Its totient is φ = 151412530.
The previous prime is 151412497. The next prime is 151412543. The reversal of 151412531 is 135214151.
151412531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (135214151) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151412531 is a prime.
It is a super-2 number, since 2×1514125312 = 45851509087651922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 151412497 and 151412506.
It is not a weakly prime, because it can be changed into another prime (151414531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75706265 + 75706266.
It is an arithmetic number, because the mean of its divisors is an integer number (75706266).
Almost surely, 2151412531 is an apocalyptic number.
151412531 is a deficient number, since it is larger than the sum of its proper divisors (1).
151412531 is an equidigital number, since it uses as much as digits as its factorization.
151412531 is an evil number, because the sum of its binary digits is even.
The product of its digits is 600, while the sum is 23.
The square root of 151412531 is about 12304.9799268426. The cubic root of 151412531 is about 532.9918967824.
Adding to 151412531 its reverse (135214151), we get a palindrome (286626682).
The spelling of 151412531 in words is "one hundred fifty-one million, four hundred twelve thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •