Base | Representation |
---|---|
bin | 10100000000110001001… |
… | …110000101010010111011 |
3 | 11212110200010020002110210 |
4 | 110000301032011102323 |
5 | 140012420104410021 |
6 | 2531433140442203 |
7 | 201233055156444 |
oct | 24006116052273 |
9 | 4773603202423 |
10 | 1375215310011 |
11 | 490253210924 |
12 | 1a26389a9363 |
13 | 9c8b3b8843a |
14 | 4a7bcaac2cb |
15 | 25b8c31ce76 |
hex | 140313854bb |
1375215310011 has 32 divisors (see below), whose sum is σ = 1879482498048. Its totient is φ = 894025912320.
The previous prime is 1375215309973. The next prime is 1375215310033. The reversal of 1375215310011 is 1100135125731.
It is not a de Polignac number, because 1375215310011 - 29 = 1375215309499 is a prime.
It is a super-3 number, since 3×13752153100113 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1375215210011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67558011 + ... + 67578363.
It is an arithmetic number, because the mean of its divisors is an integer number (58733828064).
Almost surely, 21375215310011 is an apocalyptic number.
1375215310011 is a deficient number, since it is larger than the sum of its proper divisors (504267188037).
1375215310011 is a wasteful number, since it uses less digits than its factorization.
1375215310011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22131.
The product of its (nonzero) digits is 3150, while the sum is 30.
The spelling of 1375215310011 in words is "one trillion, three hundred seventy-five billion, two hundred fifteen million, three hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •