Base | Representation |
---|---|
bin | 10100000000000110110… |
… | …000110110111011010111 |
3 | 11212101211110220021221110 |
4 | 110000012300312323113 |
5 | 140004440232142121 |
6 | 2531234333350103 |
7 | 201206315531220 |
oct | 24000660667327 |
9 | 4771743807843 |
10 | 1374503005911 |
11 | 48aa18128252 |
12 | 1a247a338333 |
13 | 9c7cc42b819 |
14 | 4a752250247 |
15 | 25b49a19d76 |
hex | 14006c36ed7 |
1374503005911 has 144 divisors (see below), whose sum is σ = 2337377575680. Its totient is φ = 703560211200.
The previous prime is 1374503005859. The next prime is 1374503005963. The reversal of 1374503005911 is 1195003054731.
It is an interprime number because it is at equal distance from previous prime (1374503005859) and next prime (1374503005963).
It is not a de Polignac number, because 1374503005911 - 225 = 1374469451479 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1374503005911.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1374503005511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 356919136 + ... + 356922986.
It is an arithmetic number, because the mean of its divisors is an integer number (16231788720).
Almost surely, 21374503005911 is an apocalyptic number.
1374503005911 is a deficient number, since it is larger than the sum of its proper divisors (962874569769).
1374503005911 is a wasteful number, since it uses less digits than its factorization.
1374503005911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4034 (or 3992 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 39.
The spelling of 1374503005911 in words is "one trillion, three hundred seventy-four billion, five hundred three million, five thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •