Base | Representation |
---|---|
bin | 11111000000011001001… |
… | …110011111110001111001 |
3 | 21112200210000210000000000 |
4 | 133000121032133301321 |
5 | 234402212103300101 |
6 | 4310501550303213 |
7 | 306640254515244 |
oct | 37003116376171 |
9 | 7480700700000 |
10 | 2130727009401 |
11 | 7516aa937931 |
12 | 2a4b481b7b09 |
13 | 125c07c43c83 |
14 | 751b072425b |
15 | 3a659a9b486 |
hex | 1f01939fc79 |
2130727009401 has 33 divisors (see below), whose sum is σ = 3196604618661. Its totient is φ = 1420248201372.
The previous prime is 2130727009381. The next prime is 2130727009417. The reversal of 2130727009401 is 1049007270312.
The square root of 2130727009401 is 1459701.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 2130727009401 - 215 = 2130726976633 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2130727001401) 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 32 ways as a sum of consecutive naturals, for example, 354704340 + ... + 354710346.
Almost surely, 22130727009401 is an apocalyptic number.
2130727009401 is the 1459701-st square number.
2130727009401 is the 729851-st centered octagonal number.
It is an amenable number.
2130727009401 is a deficient number, since it is larger than the sum of its proper divisors (1065877609260).
2130727009401 is an frugal number, since it uses more digits than its factorization.
2130727009401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12044 (or 6010 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 36.
Multiplying 2130727009401 by its sum of digits (36), we get a square (76706172338436 = 87582062).
The spelling of 2130727009401 in words is "two trillion, one hundred thirty billion, seven hundred twenty-seven million, nine thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •