Base | Representation |
---|---|
bin | 100010101000010101001011… |
… | …011001110100110001011011 |
3 | 201222021020002022110000100121 |
4 | 202220111023121310301123 |
5 | 124430331321142010121 |
6 | 1255531555220214111 |
7 | 44036452240326640 |
oct | 4250251331646133 |
9 | 658236068400317 |
10 | 152305100344411 |
11 | 44590259616613 |
12 | 150b98b9b3a337 |
13 | 66ca4037c1c51 |
14 | 298786b54ddc7 |
15 | 1291c12744141 |
hex | 8a854b674c5b |
152305100344411 has 16 divisors (see below), whose sum is σ = 178113682543104. Its totient is φ = 127509289052544.
The previous prime is 152305100344393. The next prime is 152305100344499. The reversal of 152305100344411 is 114443001503251.
It is not a de Polignac number, because 152305100344411 - 25 = 152305100344379 is a prime.
It is a super-2 number, since 2×1523051003444112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (152305100344711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15920211 + ... + 23623363.
It is an arithmetic number, because the mean of its divisors is an integer number (11132105158944).
Almost surely, 2152305100344411 is an apocalyptic number.
152305100344411 is a deficient number, since it is larger than the sum of its proper divisors (25808582198693).
152305100344411 is an equidigital number, since it uses as much as digits as its factorization.
152305100344411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7768890.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 152305100344411 its reverse (114443001503251), we get a palindrome (266748101847662).
The spelling of 152305100344411 in words is "one hundred fifty-two trillion, three hundred five billion, one hundred million, three hundred forty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •