Base | Representation |
---|---|
bin | 1011101010001011010… |
… | …0101101001011001100 |
3 | 201011000021012111110121 |
4 | 2322202310231023030 |
5 | 11240203324034012 |
6 | 232003332514324 |
7 | 20320424534164 |
oct | 2724264551314 |
9 | 634007174417 |
10 | 200300221132 |
11 | 77a46286840 |
12 | 329a017b9a4 |
13 | 15b7159680b |
14 | 99a1d115a4 |
15 | 53249c8a07 |
hex | 2ea2d2d2cc |
200300221132 has 24 divisors (see below), whose sum is σ = 382888653840. Its totient is φ = 90927144960.
The previous prime is 200300221129. The next prime is 200300221169. The reversal of 200300221132 is 231122003002.
200300221132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2003002211322 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2926033 + ... + 2993704.
It is an arithmetic number, because the mean of its divisors is an integer number (15953693910).
Almost surely, 2200300221132 is an apocalyptic number.
200300221132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200300221132 is a deficient number, since it is larger than the sum of its proper divisors (182588432708).
200300221132 is a wasteful number, since it uses less digits than its factorization.
200300221132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5920521 (or 5920519 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 200300221132 its reverse (231122003002), we get a palindrome (431422224134).
The spelling of 200300221132 in words is "two hundred billion, three hundred million, two hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •