Base | Representation |
---|---|
bin | 1011000000010100011011… |
… | …0001010011010010010000 |
3 | 1120211202111111002021202201 |
4 | 2300011012301103102100 |
5 | 3041222011202431000 |
6 | 41422414111052544 |
7 | 2356130003463442 |
oct | 260050661232220 |
9 | 46752444067681 |
10 | 12100110202000 |
11 | 394569a83a337 |
12 | 14350ba511154 |
13 | 69a05cca55c2 |
14 | 2db911528492 |
15 | 15eb41b7796a |
hex | b0146c53490 |
12100110202000 has 40 divisors (see below), whose sum is σ = 29258066473272. Its totient is φ = 4840044080000.
The previous prime is 12100110201919. The next prime is 12100110202021. The reversal of 12100110202000 is 20201100121.
It can be written as a sum of positive squares in 4 ways, for example, as 39687014656 + 12060423187344 = 199216^2 + 3472812^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3025025551 + ... + 3025029550.
Almost surely, 212100110202000 is an apocalyptic number.
12100110202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12100110202000 is an abundant number, since it is smaller than the sum of its proper divisors (17157956271272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12100110202000 is an equidigital number, since it uses as much as digits as its factorization.
12100110202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6050055124 (or 6050055108 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12100110202000 its reverse (20201100121), we get a palindrome (12120311302121).
The spelling of 12100110202000 in words is "twelve trillion, one hundred billion, one hundred ten million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •