Base | Representation |
---|---|
bin | 11110100100001100001… |
… | …110100001001111011111 |
3 | 21102210121120012212110100 |
4 | 132210030032201033133 |
5 | 233403202144444021 |
6 | 4244533011312143 |
7 | 304515651416613 |
oct | 36441416411737 |
9 | 7383546185410 |
10 | 2100444140511 |
11 | 73a87aa60262 |
12 | 29b0b65ab653 |
13 | 1230c009b742 |
14 | 7393a8c5343 |
15 | 399861e9626 |
hex | 1e90c3a13df |
2100444140511 has 12 divisors (see below), whose sum is σ = 3042569703888. Its totient is φ = 1396329247104.
The previous prime is 2100444140489. The next prime is 2100444140567. The reversal of 2100444140511 is 1150414440012.
It is a happy number.
2100444140511 is a `hidden beast` number, since 2 + 1 + 0 + 0 + 4 + 4 + 4 + 140 + 511 = 666.
It is not a de Polignac number, because 2100444140511 - 25 = 2100444140479 is a prime.
It is a super-2 number, since 2×21004441405112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100444140111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 330567195 + ... + 330573548.
It is an arithmetic number, because the mean of its divisors is an integer number (253547475324).
Almost surely, 22100444140511 is an apocalyptic number.
2100444140511 is a deficient number, since it is larger than the sum of its proper divisors (942125563377).
2100444140511 is a wasteful number, since it uses less digits than its factorization.
2100444140511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 661141102 (or 661141099 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 27.
Adding to 2100444140511 its reverse (1150414440012), we get a palindrome (3250858580523).
The spelling of 2100444140511 in words is "two trillion, one hundred billion, four hundred forty-four million, one hundred forty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •