Base | Representation |
---|---|
bin | 11111000000010001111… |
… | …101000110111010111101 |
3 | 21112200110112012211010200 |
4 | 133000101331012322331 |
5 | 234401434340314441 |
6 | 4310441511354113 |
7 | 306634243530543 |
oct | 37002175067275 |
9 | 7480415184120 |
10 | 2130605010621 |
11 | 751647a9039a |
12 | 2a4b13382939 |
13 | 125bb889a349 |
14 | 7519c447d93 |
15 | 3a64deed7b6 |
hex | 1f011f46ebd |
2130605010621 has 48 divisors (see below), whose sum is σ = 3222778890240. Its totient is φ = 1354775352480.
The previous prime is 2130605010593. The next prime is 2130605010679. The reversal of 2130605010621 is 1260105060312.
2130605010621 is a `hidden beast` number, since 2 + 1 + 30 + 6 + 0 + 5 + 0 + 1 + 0 + 621 = 666.
It is not a de Polignac number, because 2130605010621 - 222 = 2130600816317 is a prime.
It is a super-2 number, since 2×21306050106212 (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 (2130605010221) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 9592990 + ... + 9812576.
It is an arithmetic number, because the mean of its divisors is an integer number (67141226880).
Almost surely, 22130605010621 is an apocalyptic number.
It is an amenable number.
2130605010621 is a deficient number, since it is larger than the sum of its proper divisors (1092173879619).
2130605010621 is a wasteful number, since it uses less digits than its factorization.
2130605010621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220126 (or 220123 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The spelling of 2130605010621 in words is "two trillion, one hundred thirty billion, six hundred five million, ten thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •