Base | Representation |
---|---|
bin | 10010000000001… |
… | …10001000000001 |
3 | 101112011121112120 |
4 | 21000012020001 |
5 | 302130120113 |
6 | 22552514453 |
7 | 3512435433 |
oct | 1100061001 |
9 | 345147476 |
10 | 151020033 |
11 | 7827964a |
12 | 426aba29 |
13 | 25398288 |
14 | 160b2653 |
15 | d3d1a23 |
hex | 9006201 |
151020033 has 4 divisors (see below), whose sum is σ = 201360048. Its totient is φ = 100680020.
The previous prime is 151020031. The next prime is 151020041. The reversal of 151020033 is 330020151.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 330020151 = 3 ⋅110006717.
It is a cyclic number.
It is not a de Polignac number, because 151020033 - 21 = 151020031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 151019994 and 151020021.
It is not an unprimeable number, because it can be changed into a prime (151020031) 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, 25170003 + ... + 25170008.
It is an arithmetic number, because the mean of its divisors is an integer number (50340012).
Almost surely, 2151020033 is an apocalyptic number.
It is an amenable number.
151020033 is a deficient number, since it is larger than the sum of its proper divisors (50340015).
151020033 is an equidigital number, since it uses as much as digits as its factorization.
151020033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50340014.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 151020033 is about 12289.0208316204. The cubic root of 151020033 is about 532.5309501727.
Adding to 151020033 its reverse (330020151), we get a palindrome (481040184).
The spelling of 151020033 in words is "one hundred fifty-one million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •