Base | Representation |
---|---|
bin | 11110111111111011001… |
… | …000000101101001010100 |
3 | 21112122110211112112012001 |
4 | 132333323020011221110 |
5 | 234400143313404022 |
6 | 4310335510405044 |
7 | 306621613231462 |
oct | 36777310055124 |
9 | 7478424475161 |
10 | 2130222013012 |
11 | 751470878645 |
12 | 2a4a27060784 |
13 | 125b5742c942 |
14 | 7516362b832 |
15 | 3a62a597b27 |
hex | 1effb205a54 |
2130222013012 has 12 divisors (see below), whose sum is σ = 3947176083060. Its totient is φ = 1002457417856.
The previous prime is 2130222012991. The next prime is 2130222013033. The reversal of 2130222013012 is 2103102220312.
It is an interprime number because it is at equal distance from previous prime (2130222012991) and next prime (2130222013033).
It can be written as a sum of positive squares in 2 ways, for example, as 1590943278276 + 539278734736 = 1261326^2 + 734356^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15663397087 + ... + 15663397222.
It is an arithmetic number, because the mean of its divisors is an integer number (328931340255).
Almost surely, 22130222013012 is an apocalyptic number.
It is an amenable number.
2130222013012 is a deficient number, since it is larger than the sum of its proper divisors (1816954070048).
2130222013012 is a wasteful number, since it uses less digits than its factorization.
2130222013012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31326794330 (or 31326794328 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 2130222013012 its reverse (2103102220312), we get a palindrome (4233324233324).
The spelling of 2130222013012 in words is "two trillion, one hundred thirty billion, two hundred twenty-two million, thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •