Base | Representation |
---|---|
bin | 1011000110001100010110… |
… | …0001011100100110100100 |
3 | 1121012101222010112222010101 |
4 | 2301203011201130212210 |
5 | 3044400142334000400 |
6 | 41541023251433444 |
7 | 2366331450223132 |
oct | 261430541344644 |
9 | 47171863488111 |
10 | 12201021000100 |
11 | 3984473302539 |
12 | 14507812b5884 |
13 | 6a67223bc61a |
14 | 302765516752 |
15 | 16259ad2356a |
hex | b18c585c9a4 |
12201021000100 has 36 divisors (see below), whose sum is σ = 26614834541568. Its totient is φ = 4854856516000.
The previous prime is 12201021000071. The next prime is 12201021000139. The reversal of 12201021000100 is 100012010221.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 11 ways as a sum of consecutive naturals, for example, 319379356 + ... + 319417555.
It is an arithmetic number, because the mean of its divisors is an integer number (739300959488).
Almost surely, 212201021000100 is an apocalyptic number.
12201021000100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12201021000100 is an abundant number, since it is smaller than the sum of its proper divisors (14413813541468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12201021000100 is a wasteful number, since it uses less digits than its factorization.
12201021000100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 638797116 (or 638797109 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12201021000100 its reverse (100012010221), we get a palindrome (12301033010321).
The spelling of 12201021000100 in words is "twelve trillion, two hundred one billion, twenty-one million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •