Base | Representation |
---|---|
bin | 1000111000001100001… |
… | …0110100100000100101 |
3 | 112120200112211012220221 |
4 | 2032003002310200211 |
5 | 4444331214110041 |
6 | 154022352324341 |
7 | 14006435044222 |
oct | 2160302644045 |
9 | 476615735827 |
10 | 152522410021 |
11 | 59758a19133 |
12 | 256875436b1 |
13 | 114c9026c77 |
14 | 754c796949 |
15 | 3e7a2852d1 |
hex | 23830b4825 |
152522410021 has 12 divisors (see below), whose sum is σ = 161724053700. Its totient is φ = 143671189760.
The previous prime is 152522410009. The next prime is 152522410039. The reversal of 152522410021 is 120014225251.
It can be written as a sum of positive squares in 6 ways, for example, as 21757725025 + 130764684996 = 147505^2 + 361614^2 .
It is not a de Polignac number, because 152522410021 - 227 = 152388192293 is a prime.
It is a super-2 number, since 2×1525224100212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152522410081) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1515616 + ... + 1613113.
It is an arithmetic number, because the mean of its divisors is an integer number (13477004475).
Almost surely, 2152522410021 is an apocalyptic number.
It is an amenable number.
152522410021 is a deficient number, since it is larger than the sum of its proper divisors (9201643679).
152522410021 is an equidigital number, since it uses as much as digits as its factorization.
152522410021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3128840 (or 3128799 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 25.
Adding to 152522410021 its reverse (120014225251), we get a palindrome (272536635272).
The spelling of 152522410021 in words is "one hundred fifty-two billion, five hundred twenty-two million, four hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •