Base | Representation |
---|---|
bin | 11110110001001100010… |
… | …011100011011111000100 |
3 | 21111010122110100111110000 |
4 | 132301030103203133010 |
5 | 234120244422313012 |
6 | 4255202134001300 |
7 | 305521622226165 |
oct | 36611423433704 |
9 | 7433573314400 |
10 | 2114404104132 |
11 | 745793aa3581 |
12 | 2a19517a6230 |
13 | 124506300348 |
14 | 744a293976c |
15 | 3a001a6eddc |
hex | 1ec4c4e37c4 |
2114404104132 has 30 divisors (see below), whose sum is σ = 5527469989118. Its totient is φ = 704801367936.
The previous prime is 2114404104107. The next prime is 2114404104173. The reversal of 2114404104132 is 2314014044112.
2114404104132 is a `hidden beast` number, since 2 + 114 + 4 + 0 + 410 + 4 + 132 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2094752550276 + 19651553856 = 1447326^2 + 140184^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2114404104096 and 2114404104105.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3262968973 + ... + 3262969620.
Almost surely, 22114404104132 is an apocalyptic number.
It is an amenable number.
2114404104132 is an abundant number, since it is smaller than the sum of its proper divisors (3413065884986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2114404104132 is a wasteful number, since it uses less digits than its factorization.
2114404104132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6525938609 (or 6525938598 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 2114404104132 its reverse (2314014044112), we get a palindrome (4428418148244).
The spelling of 2114404104132 in words is "two trillion, one hundred fourteen billion, four hundred four million, one hundred four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •