Base | Representation |
---|---|
bin | 10111110111101010001… |
… | …110010100011011010001 |
3 | 12210210221011201111020100 |
4 | 113313222032110123101 |
5 | 203333324403141001 |
6 | 3253314330203013 |
7 | 226336315220112 |
oct | 27675216243321 |
9 | 5723834644210 |
10 | 1640312162001 |
11 | 58271a4a8457 |
12 | 225aa1283469 |
13 | bb8b0874036 |
14 | 5956a516209 |
15 | 2ca056cd586 |
hex | 17dea3946d1 |
1640312162001 has 12 divisors (see below), whose sum is σ = 2472354563328. Its totient is φ = 1045996161144.
The previous prime is 1640312161997. The next prime is 1640312162003. The reversal of 1640312162001 is 1002612130461.
It is a happy number.
1640312162001 is a `hidden beast` number, since 1 + 6 + 4 + 0 + 31 + 2 + 1 + 620 + 0 + 1 = 666.
It is not a de Polignac number, because 1640312162001 - 22 = 1640312161997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1640312162003) 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 11 ways as a sum of consecutive naturals, for example, 3962106465 + ... + 3962106878.
It is an arithmetic number, because the mean of its divisors is an integer number (206029546944).
Almost surely, 21640312162001 is an apocalyptic number.
It is an amenable number.
1640312162001 is a deficient number, since it is larger than the sum of its proper divisors (832042401327).
1640312162001 is a wasteful number, since it uses less digits than its factorization.
1640312162001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7924213372 (or 7924213369 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 1640312162001 its reverse (1002612130461), we get a palindrome (2642924292462).
The spelling of 1640312162001 in words is "one trillion, six hundred forty billion, three hundred twelve million, one hundred sixty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •