Base | Representation |
---|---|
bin | 10111110111100100111… |
… | …110100000100000011101 |
3 | 12210210201001002001112122 |
4 | 113313210332200200131 |
5 | 203333134334143401 |
6 | 3253301503312325 |
7 | 226334166035213 |
oct | 27674476404035 |
9 | 5723631061478 |
10 | 1640224131101 |
11 | 582684841546 |
12 | 225a778ab6a5 |
13 | bb89856144a |
14 | 5955c95ccb3 |
15 | 2c9ecae021b |
hex | 17de4fa081d |
1640224131101 has 4 divisors (see below), whose sum is σ = 1640306619900. Its totient is φ = 1640141642304.
The previous prime is 1640224131053. The next prime is 1640224131103. The reversal of 1640224131101 is 1011314220461.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1217237791225 + 422986339876 = 1103285^2 + 650374^2 .
It is a cyclic number.
It is not a de Polignac number, because 1640224131101 - 26 = 1640224131037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1640224131103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41214566 + ... + 41254343.
It is an arithmetic number, because the mean of its divisors is an integer number (410076654975).
Almost surely, 21640224131101 is an apocalyptic number.
It is an amenable number.
1640224131101 is a deficient number, since it is larger than the sum of its proper divisors (82488799).
1640224131101 is an equidigital number, since it uses as much as digits as its factorization.
1640224131101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82488798.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 1640224131101 its reverse (1011314220461), we get a palindrome (2651538351562).
The spelling of 1640224131101 in words is "one trillion, six hundred forty billion, two hundred twenty-four million, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.315 sec. • engine limits •