Base | Representation |
---|---|
bin | 10010000011001… |
… | …10000110001101 |
3 | 101112220120202211 |
4 | 21001212012031 |
5 | 302230210013 |
6 | 23005150421 |
7 | 3515663464 |
oct | 1101460615 |
9 | 345816684 |
10 | 151413133 |
11 | 78517a23 |
12 | 4285b411 |
13 | 254a5191 |
14 | 161759db |
15 | d45d23d |
hex | 906618d |
151413133 has 2 divisors, whose sum is σ = 151413134. Its totient is φ = 151413132.
The previous prime is 151413131. The next prime is 151413137. The reversal of 151413133 is 331314151.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100761444 + 50651689 = 10038^2 + 7117^2 .
It is a cyclic number.
It is not a de Polignac number, because 151413133 - 21 = 151413131 is a prime.
Together with 151413131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151413131) 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 as a sum of consecutive naturals, namely, 75706566 + 75706567.
It is an arithmetic number, because the mean of its divisors is an integer number (75706567).
Almost surely, 2151413133 is an apocalyptic number.
It is an amenable number.
151413133 is a deficient number, since it is larger than the sum of its proper divisors (1).
151413133 is an equidigital number, since it uses as much as digits as its factorization.
151413133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 540, while the sum is 22.
The square root of 151413133 is about 12305.0043884592. The cubic root of 151413133 is about 532.9926031543.
Adding to 151413133 its reverse (331314151), we get a palindrome (482727284).
The spelling of 151413133 in words is "one hundred fifty-one million, four hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •