Base | Representation |
---|---|
bin | 1011000000010100110101… |
… | …0100100010000110001000 |
3 | 1120211202210010212201212001 |
4 | 2300011031110202012020 |
5 | 3041222222321213000 |
6 | 41422433034400344 |
7 | 2356132506554623 |
oct | 260051524420610 |
9 | 46752703781761 |
10 | 12100220101000 |
11 | 3945746882059 |
12 | 143512b2900b4 |
13 | 69a0799a39b5 |
14 | 2db921d74dba |
15 | 15eb4b63546a |
hex | b014d522188 |
12100220101000 has 128 divisors (see below), whose sum is σ = 31013871688800. Its totient is φ = 4398294835200.
The previous prime is 12100220100977. The next prime is 12100220101003. The reversal of 12100220101000 is 10102200121.
It can be written as a sum of positive squares in 16 ways, for example, as 961807795524 + 11138412305476 = 980718^2 + 3337426^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (12100220101003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11779029 + ... + 12765028.
Almost surely, 212100220101000 is an apocalyptic number.
12100220101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12100220101000 is an abundant number, since it is smaller than the sum of its proper divisors (18913651587800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12100220101000 is a wasteful number, since it uses less digits than its factorization.
12100220101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24544124 (or 24544110 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12100220101000 its reverse (10102200121), we get a palindrome (12110322301121).
The spelling of 12100220101000 in words is "twelve trillion, one hundred billion, two hundred twenty million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •