Base | Representation |
---|---|
bin | 10010000010000… |
… | …10001100110001 |
3 | 101112122010002001 |
4 | 21001002030301 |
5 | 302211003342 |
6 | 23002054001 |
7 | 3514512013 |
oct | 1101021461 |
9 | 345563061 |
10 | 151266097 |
11 | 78427504 |
12 | 427aa301 |
13 | 25453288 |
14 | 161381b3 |
15 | d42e8b7 |
hex | 9042331 |
151266097 has 4 divisors (see below), whose sum is σ = 154955556. Its totient is φ = 147576640.
The previous prime is 151266083. The next prime is 151266107. The reversal of 151266097 is 790662151.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 790662151 = 937 ⋅843823.
It can be written as a sum of positive squares in 2 ways, for example, as 24117921 + 127148176 = 4911^2 + 11276^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151266097 is a prime.
It is a super-2 number, since 2×1512660972 = 45762864203226818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151266067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1844668 + ... + 1844749.
It is an arithmetic number, because the mean of its divisors is an integer number (38738889).
Almost surely, 2151266097 is an apocalyptic number.
It is an amenable number.
151266097 is a deficient number, since it is larger than the sum of its proper divisors (3689459).
151266097 is an equidigital number, since it uses as much as digits as its factorization.
151266097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3689458.
The product of its (nonzero) digits is 22680, while the sum is 37.
The square root of 151266097 is about 12299.0282949508. The cubic root of 151266097 is about 532.8200190893.
The spelling of 151266097 in words is "one hundred fifty-one million, two hundred sixty-six thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •