Base | Representation |
---|---|
bin | 10100001110110010110… |
… | …110110001000001110110 |
3 | 11220220112122221121020222 |
4 | 110032302312301001312 |
5 | 140234240413401104 |
6 | 2542403353054342 |
7 | 202305212454464 |
oct | 24166266610166 |
9 | 4826478847228 |
10 | 1390275137654 |
11 | 496681086277 |
12 | 1a55403b73b2 |
13 | a1143c20b60 |
14 | 4b40ac27834 |
15 | 2626e4ee1be |
hex | 143b2db1076 |
1390275137654 has 16 divisors (see below), whose sum is σ = 2364030599280. Its totient is φ = 607893582240.
The previous prime is 1390275137621. The next prime is 1390275137717. The reversal of 1390275137654 is 4567315720931.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1390275137596 and 1390275137605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1407160577 + ... + 1407161564.
It is an arithmetic number, because the mean of its divisors is an integer number (147751912455).
Almost surely, 21390275137654 is an apocalyptic number.
1390275137654 is a deficient number, since it is larger than the sum of its proper divisors (973755461626).
1390275137654 is a wasteful number, since it uses less digits than its factorization.
1390275137654 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2814322175.
The product of its (nonzero) digits is 4762800, while the sum is 53.
The spelling of 1390275137654 in words is "one trillion, three hundred ninety billion, two hundred seventy-five million, one hundred thirty-seven thousand, six hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •