Base | Representation |
---|---|
bin | 1001100111100111010010… |
… | …10111111001101101100011 |
3 | 2202220010212112210022112101 |
4 | 10303303221113321231203 |
5 | 10233024440041310111 |
6 | 112553125341511231 |
7 | 4312130364114136 |
oct | 463635127715543 |
9 | 82803775708471 |
10 | 21152334322531 |
11 | 6815722315155 |
12 | 2457569b72517 |
13 | ba586c630459 |
14 | 531ac809a21d |
15 | 26a34a0ccbc1 |
hex | 133ce95f9b63 |
21152334322531 has 8 divisors (see below), whose sum is σ = 21413258874000. Its totient is φ = 20892995939040.
The previous prime is 21152334322517. The next prime is 21152334322543. The reversal of 21152334322531 is 13522343325112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21152334322531 - 211 = 21152334320483 is a prime.
It is a super-2 number, since 2×211523343225312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21152334325531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 396515160 + ... + 396568501.
It is an arithmetic number, because the mean of its divisors is an integer number (2676657359250).
Almost surely, 221152334322531 is an apocalyptic number.
21152334322531 is a deficient number, since it is larger than the sum of its proper divisors (260924551469).
21152334322531 is a wasteful number, since it uses less digits than its factorization.
21152334322531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 793083989.
The product of its digits is 129600, while the sum is 37.
Adding to 21152334322531 its reverse (13522343325112), we get a palindrome (34674677647643).
The spelling of 21152334322531 in words is "twenty-one trillion, one hundred fifty-two billion, three hundred thirty-four million, three hundred twenty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •