Base | Representation |
---|---|
bin | 11110111100000111110… |
… | …101011100001011001001 |
3 | 21112020221101000001011000 |
4 | 132330013311130023021 |
5 | 234313313401323230 |
6 | 4304422500325213 |
7 | 306415511014152 |
oct | 36740765341311 |
9 | 7466841001130 |
10 | 2126140261065 |
11 | 74a766826a27 |
12 | 2a40880a3809 |
13 | 1256568b65c2 |
14 | 74c974b6929 |
15 | 3a48c074b60 |
hex | 1ef07d5c2c9 |
2126140261065 has 32 divisors (see below), whose sum is σ = 3789673943040. Its totient is φ = 1130980762368.
The previous prime is 2126140261033. The next prime is 2126140261067. The reversal of 2126140261065 is 5601620416212.
2126140261065 is a `hidden beast` number, since 2 + 1 + 2 + 614 + 0 + 26 + 10 + 6 + 5 = 666.
It is not a de Polignac number, because 2126140261065 - 25 = 2126140261033 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2126140261067) 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 31 ways as a sum of consecutive naturals, for example, 20508592 + ... + 20612001.
It is an arithmetic number, because the mean of its divisors is an integer number (118427310720).
Almost surely, 22126140261065 is an apocalyptic number.
It is an amenable number.
2126140261065 is a deficient number, since it is larger than the sum of its proper divisors (1663533681975).
2126140261065 is a wasteful number, since it uses less digits than its factorization.
2126140261065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41120990 (or 41120984 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
Adding to 2126140261065 its reverse (5601620416212), we get a palindrome (7727760677277).
The spelling of 2126140261065 in words is "two trillion, one hundred twenty-six billion, one hundred forty million, two hundred sixty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •