Base | Representation |
---|---|
bin | 1000110110010101011… |
… | …0110111101011100001 |
3 | 112112101211122010012121 |
4 | 2031211112313223201 |
5 | 4442321213140114 |
6 | 153501121224241 |
7 | 13661206435402 |
oct | 2154526675341 |
9 | 475354563177 |
10 | 152024349409 |
11 | 59522866899 |
12 | 25568792081 |
13 | 11449aa084a |
14 | 75025879a9 |
15 | 3e4b6a1a24 |
hex | 23655b7ae1 |
152024349409 has 3 divisors (see below), whose sum is σ = 152024739313. Its totient is φ = 152023959506.
The previous prime is 152024349377. The next prime is 152024349419. The reversal of 152024349409 is 904943420251.
The square root of 152024349409 is 389903.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 152024349409 - 25 = 152024349377 is a prime.
It is a super-2 number, since 2×1520243494092 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152024349419) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 194952 + ... + 584854.
Almost surely, 2152024349409 is an apocalyptic number.
152024349409 is the 389903-rd square number.
152024349409 is the 194952-nd centered octagonal number.
It is an amenable number.
152024349409 is a deficient number, since it is larger than the sum of its proper divisors (389904).
152024349409 is an frugal number, since it uses more digits than its factorization.
152024349409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 779806 (or 389903 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 43.
The spelling of 152024349409 in words is "one hundred fifty-two billion, twenty-four million, three hundred forty-nine thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •