Base | Representation |
---|---|
bin | 10010001001111… |
… | …11010110111011 |
3 | 101121120210111011 |
4 | 21010333112323 |
5 | 302442144120 |
6 | 23040214351 |
7 | 3526361113 |
oct | 1104772673 |
9 | 347523434 |
10 | 152303035 |
11 | 78a75585 |
12 | 4300a3b7 |
13 | 25727251 |
14 | 16328043 |
15 | d586c5a |
hex | 913f5bb |
152303035 has 8 divisors (see below), whose sum is σ = 183493296. Its totient is φ = 121356000.
The previous prime is 152303029. The next prime is 152303057. The reversal of 152303035 is 530303251.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 152303035 - 23 = 152303027 is a prime.
It is a super-2 number, since 2×1523030352 = 46392428940422450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152302997 and 152303015.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 59424 + ... + 61933.
It is an arithmetic number, because the mean of its divisors is an integer number (22936662).
Almost surely, 2152303035 is an apocalyptic number.
152303035 is a deficient number, since it is larger than the sum of its proper divisors (31190261).
152303035 is a wasteful number, since it uses less digits than its factorization.
152303035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121613.
The product of its (nonzero) digits is 1350, while the sum is 22.
The square root of 152303035 is about 12341.1115787841. Note that the first 3 decimals coincide. The cubic root of 152303035 is about 534.0347518145.
Adding to 152303035 its reverse (530303251), we get a palindrome (682606286).
The spelling of 152303035 in words is "one hundred fifty-two million, three hundred three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •