Base | Representation |
---|---|
bin | 11110100011111110010… |
… | …001101110111011111100 |
3 | 21102210000020211110222210 |
4 | 132203332101232323330 |
5 | 233402212241231022 |
6 | 4244453451140420 |
7 | 304510110213621 |
oct | 36437621567374 |
9 | 7383006743883 |
10 | 2100210102012 |
11 | 73a76a939710 |
12 | 29b050144710 |
13 | 123083757219 |
14 | 739177a2348 |
15 | 399708b9a0c |
hex | 1e8fe46eefc |
2100210102012 has 48 divisors (see below), whose sum is σ = 5421284999424. Its totient is φ = 627463536000.
The previous prime is 2100210101989. The next prime is 2100210102061. The reversal of 2100210102012 is 2102010120012.
It is a super-3 number, since 3×21002101020123 (a number of 38 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 112037689 + ... + 112056432.
It is an arithmetic number, because the mean of its divisors is an integer number (112943437488).
Almost surely, 22100210102012 is an apocalyptic number.
2100210102012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2100210102012 is an abundant number, since it is smaller than the sum of its proper divisors (3321074897412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2100210102012 is a wasteful number, since it uses less digits than its factorization.
2100210102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224094210 (or 224094208 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2100210102012 its reverse (2102010120012), we get a palindrome (4202220222024).
The spelling of 2100210102012 in words is "two trillion, one hundred billion, two hundred ten million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •