Base | Representation |
---|---|
bin | 11110110000111100000… |
… | …110011011000001110101 |
3 | 21111002221111202122222200 |
4 | 132300330012123001311 |
5 | 234114220322214130 |
6 | 4255115142415113 |
7 | 305512111264101 |
oct | 36607406330165 |
9 | 7432844678880 |
10 | 2114132226165 |
11 | 745664587643 |
12 | 2a1896731499 |
13 | 124491b9a7cb |
14 | 744787a6901 |
15 | 39ed7c68760 |
hex | 1ec3c19b075 |
2114132226165 has 12 divisors (see below), whose sum is σ = 3664495858764. Its totient is φ = 1127537187264.
The previous prime is 2114132226161. The next prime is 2114132226197. The reversal of 2114132226165 is 5616222314112.
2114132226165 is a `hidden beast` number, since 2 + 1 + 1 + 4 + 1 + 32 + 2 + 2 + 616 + 5 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1590648141681 + 523484084484 = 1261209^2 + 723522^2 .
It is not a de Polignac number, because 2114132226165 - 22 = 2114132226161 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2114132226161) 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, 23490358024 + ... + 23490358113.
It is an arithmetic number, because the mean of its divisors is an integer number (305374654897).
Almost surely, 22114132226165 is an apocalyptic number.
It is an amenable number.
2114132226165 is a deficient number, since it is larger than the sum of its proper divisors (1550363632599).
2114132226165 is a wasteful number, since it uses less digits than its factorization.
2114132226165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46980716148 (or 46980716145 counting only the distinct ones).
The product of its digits is 34560, while the sum is 36.
The spelling of 2114132226165 in words is "two trillion, one hundred fourteen billion, one hundred thirty-two million, two hundred twenty-six thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •