Base | Representation |
---|---|
bin | 1000111010110010110… |
… | …0011111100001111111 |
3 | 112122111020201102120020 |
4 | 2032230230133201333 |
5 | 10002244111344444 |
6 | 154215554023223 |
7 | 14032651465620 |
oct | 2165454374177 |
9 | 478436642506 |
10 | 153221199999 |
11 | 59a8741140a |
12 | 25841577b13 |
13 | 115aaa3166a |
14 | 75b74d7a47 |
15 | 3ebb7b9119 |
hex | 23acb1f87f |
153221199999 has 32 divisors (see below), whose sum is σ = 241291298304. Its totient is φ = 84663505920.
The previous prime is 153221199997. The next prime is 153221200007. The reversal of 153221199999 is 999991122351.
It is not a de Polignac number, because 153221199999 - 21 = 153221199997 is a prime.
It is a super-2 number, since 2×1532211999992 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153221199997) 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 31 ways as a sum of consecutive naturals, for example, 690129 + ... + 884714.
It is an arithmetic number, because the mean of its divisors is an integer number (7540353072).
Almost surely, 2153221199999 is an apocalyptic number.
153221199999 is a deficient number, since it is larger than the sum of its proper divisors (88070098305).
153221199999 is a wasteful number, since it uses less digits than its factorization.
153221199999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1575007.
The product of its digits is 3542940, while the sum is 60.
It can be divided in two parts, 153221 and 199999, that added together give a triangular number (353220 = T840).
The spelling of 153221199999 in words is "one hundred fifty-three billion, two hundred twenty-one million, one hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •