Base | Representation |
---|---|
bin | 1011000111111001000011… |
… | …0010011001011010010100 |
3 | 1121022012021201220200010221 |
4 | 2301332100302121122110 |
5 | 3100334422430201400 |
6 | 42002250552524124 |
7 | 2401413532300435 |
oct | 261762062313224 |
9 | 47265251820127 |
10 | 12230201022100 |
11 | 39958876aa9a6 |
12 | 14563656b0644 |
13 | 6a93c2928429 |
14 | 303d32ab548c |
15 | 16320797ac1a |
hex | b1f90c99694 |
12230201022100 has 18 divisors (see below), whose sum is σ = 26539536218174. Its totient is φ = 4892080408800.
The previous prime is 12230201022077. The next prime is 12230201022101. The reversal of 12230201022100 is 122010203221.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 106183436164 + 12124017585936 = 325858^2 + 3481956^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12230201022101) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61151005011 + ... + 61151005210.
Almost surely, 212230201022100 is an apocalyptic number.
12230201022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12230201022100 is an abundant number, since it is smaller than the sum of its proper divisors (14309335196074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12230201022100 is a wasteful number, since it uses less digits than its factorization.
12230201022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122302010235 (or 122302010228 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 12230201022100 its reverse (122010203221), we get a palindrome (12352211225321).
The spelling of 12230201022100 in words is "twelve trillion, two hundred thirty billion, two hundred one million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •