Base | Representation |
---|---|
bin | 11101101110001000100… |
… | …00111001001111000111 |
3 | 10121121220011222122001020 |
4 | 32313010100321033013 |
5 | 113212404200342411 |
6 | 2101044404202223 |
7 | 133531200611610 |
oct | 16670420711707 |
9 | 3547804878036 |
10 | 1021200012231 |
11 | 3640a7869963 |
12 | 145ab9999373 |
13 | 753b6470389 |
14 | 375d7c62c07 |
15 | 1b86ca21606 |
hex | edc44393c7 |
1021200012231 has 8 divisors (see below), whose sum is σ = 1556114304384. Its totient is φ = 583542864120.
The previous prime is 1021200012223. The next prime is 1021200012233. The reversal of 1021200012231 is 1322100021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1021200012231 - 23 = 1021200012223 is a prime.
It is a super-2 number, since 2×10212000122312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1021200012231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021200012233) 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, 24314285985 + ... + 24314286026.
It is an arithmetic number, because the mean of its divisors is an integer number (194514288048).
Almost surely, 21021200012231 is an apocalyptic number.
1021200012231 is a deficient number, since it is larger than the sum of its proper divisors (534914292153).
1021200012231 is an equidigital number, since it uses as much as digits as its factorization.
1021200012231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48628572021.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1021200012231 its reverse (1322100021201), we get a palindrome (2343300033432).
The spelling of 1021200012231 in words is "one trillion, twenty-one billion, two hundred million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •