Base | Representation |
---|---|
bin | 11111001001010101001… |
… | …000111111011111110001 |
3 | 21120121112201200211111012 |
4 | 133021111020333133301 |
5 | 240031334431242001 |
6 | 4315130031200305 |
7 | 310430114651402 |
oct | 37112510773761 |
9 | 7517481624435 |
10 | 2140322134001 |
11 | 755784056a77 |
12 | 2a6985676095 |
13 | 126aa6aa39ac |
14 | 75840bb39a9 |
15 | 3aa1c1312bb |
hex | 1f25523f7f1 |
2140322134001 has 12 divisors (see below), whose sum is σ = 2275348096560. Its totient is φ = 2012565219720.
The previous prime is 2140322133947. The next prime is 2140322134037. The reversal of 2140322134001 is 1004312230412.
It is not a de Polignac number, because 2140322134001 - 214 = 2140322117617 is a prime.
It is a super-3 number, since 3×21403221340013 (a number of 38 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2140322134801) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34256735 + ... + 34319156.
It is an arithmetic number, because the mean of its divisors is an integer number (189612341380).
Almost surely, 22140322134001 is an apocalyptic number.
It is an amenable number.
2140322134001 is a deficient number, since it is larger than the sum of its proper divisors (135025962559).
2140322134001 is an equidigital number, since it uses as much as digits as its factorization.
2140322134001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68575996 (or 68575973 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2140322134001 its reverse (1004312230412), we get a palindrome (3144634364413).
The spelling of 2140322134001 in words is "two trillion, one hundred forty billion, three hundred twenty-two million, one hundred thirty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •