Base | Representation |
---|---|
bin | 11110110000111010010… |
… | …011001110111100010100 |
3 | 21111002212101221112202220 |
4 | 132300322103032330110 |
5 | 234114140104430400 |
6 | 4255112143302340 |
7 | 305511263520654 |
oct | 36607223167424 |
9 | 7432771845686 |
10 | 2114102030100 |
11 | 745649532915 |
12 | 2a18885aa9b0 |
13 | 124488857508 |
14 | 74474786364 |
15 | 39ed52a17a0 |
hex | 1ec3a4cef14 |
2114102030100 has 72 divisors (see below), whose sum is σ = 6438738831840. Its totient is φ = 534088932480.
The previous prime is 2114102030057. The next prime is 2114102030147. The reversal of 2114102030100 is 10302014112.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2114102030100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 185441847 + ... + 185453246.
It is an arithmetic number, because the mean of its divisors is an integer number (89426928220).
Almost surely, 22114102030100 is an apocalyptic number.
2114102030100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2114102030100 is an abundant number, since it is smaller than the sum of its proper divisors (4324636801740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2114102030100 is a wasteful number, since it uses less digits than its factorization.
2114102030100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 370895129 (or 370895122 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2114102030100 its reverse (10302014112), we get a palindrome (2124404044212).
The spelling of 2114102030100 in words is "two trillion, one hundred fourteen billion, one hundred two million, thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •