Base | Representation |
---|---|
bin | 10001100111000101100… |
… | …011110010011001111111 |
3 | 11021200201221101012111000 |
4 | 101213011203302121333 |
5 | 124311442234200411 |
6 | 2323543000301343 |
7 | 153301614564303 |
oct | 21470543623177 |
9 | 4250657335430 |
10 | 1210200303231 |
11 | 427274580967 |
12 | 176665771853 |
13 | 8a1769374aa |
14 | 4280710bd03 |
15 | 21730462956 |
hex | 119c58f267f |
1210200303231 has 32 divisors (see below), whose sum is σ = 1882395475200. Its totient is φ = 767352912480.
The previous prime is 1210200303217. The next prime is 1210200303269. The reversal of 1210200303231 is 1323030020121.
It is not a de Polignac number, because 1210200303231 - 29 = 1210200302719 is a prime.
It is a super-2 number, since 2×12102003032312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210200303731) 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, 11481825 + ... + 11586746.
It is an arithmetic number, because the mean of its divisors is an integer number (58824858600).
Almost surely, 21210200303231 is an apocalyptic number.
1210200303231 is a deficient number, since it is larger than the sum of its proper divisors (672195171969).
1210200303231 is a wasteful number, since it uses less digits than its factorization.
1210200303231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23068676 (or 23068670 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1210200303231 its reverse (1323030020121), we get a palindrome (2533230323352).
The spelling of 1210200303231 in words is "one trillion, two hundred ten billion, two hundred million, three hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •