Base | Representation |
---|---|
bin | 10010001010101… |
… | …11111110111010 |
3 | 101121202220211211 |
4 | 21011113332322 |
5 | 303003411043 |
6 | 23042313334 |
7 | 3530261143 |
oct | 1105277672 |
9 | 347686754 |
10 | 152403898 |
11 | 79034339 |
12 | 4305884a |
13 | 2576112a |
14 | 16352aca |
15 | d5a6a9d |
hex | 9157fba |
152403898 has 4 divisors (see below), whose sum is σ = 228605850. Its totient is φ = 76201948.
The previous prime is 152403893. The next prime is 152403899. The reversal of 152403898 is 898304251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 898304251 = 13 ⋅69100327.
It can be written as a sum of positive squares in only one way, i.e., 133333209 + 19070689 = 11547^2 + 4367^2 .
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 152403898.
It is not an unprimeable number, because it can be changed into a prime (152403893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38100973 + ... + 38100976.
Almost surely, 2152403898 is an apocalyptic number.
152403898 is a deficient number, since it is larger than the sum of its proper divisors (76201952).
152403898 is an equidigital number, since it uses as much as digits as its factorization.
152403898 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76201951.
The product of its (nonzero) digits is 69120, while the sum is 40.
The square root of 152403898 is about 12345.1973657775. The cubic root of 152403898 is about 534.1526143398.
The spelling of 152403898 in words is "one hundred fifty-two million, four hundred three thousand, eight hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •