Base | Representation |
---|---|
bin | 1000111000000101011… |
… | …1000110000010000001 |
3 | 112120121120200111020011 |
4 | 2032001113012002001 |
5 | 4444302001421431 |
6 | 154015503144521 |
7 | 14005643026420 |
oct | 2160127060201 |
9 | 476546614204 |
10 | 152494170241 |
11 | 59743a90176 |
12 | 25679ba5141 |
13 | 114c321a23a |
14 | 7548b252b7 |
15 | 3e77a57cb1 |
hex | 23815c6081 |
152494170241 has 4 divisors (see below), whose sum is σ = 174279051712. Its totient is φ = 130709288772.
The previous prime is 152494170233. The next prime is 152494170271. The reversal of 152494170241 is 142071494251.
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.
It is a cyclic number.
It is not a de Polignac number, because 152494170241 - 23 = 152494170233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152494170194 and 152494170203.
It is not an unprimeable number, because it can be changed into a prime (152494170271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10892440725 + ... + 10892440738.
It is an arithmetic number, because the mean of its divisors is an integer number (43569762928).
Almost surely, 2152494170241 is an apocalyptic number.
It is an amenable number.
152494170241 is a deficient number, since it is larger than the sum of its proper divisors (21784881471).
152494170241 is an equidigital number, since it uses as much as digits as its factorization.
152494170241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21784881470.
The product of its (nonzero) digits is 80640, while the sum is 40.
The spelling of 152494170241 in words is "one hundred fifty-two billion, four hundred ninety-four million, one hundred seventy thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •