Base | Representation |
---|---|
bin | 11101011001110111100… |
… | …01110110110110001101 |
3 | 10120120210221202221022122 |
4 | 32230323301312312031 |
5 | 113023113440140023 |
6 | 2052045033022325 |
7 | 132664451226230 |
oct | 16547361666615 |
9 | 3516727687278 |
10 | 1010320240013 |
11 | 35a524488a77 |
12 | 1439822549a5 |
13 | 7437141c536 |
14 | 36c84d2b417 |
15 | 1b4327d02c8 |
hex | eb3bc76d8d |
1010320240013 has 16 divisors (see below), whose sum is σ = 1163356139520. Its totient is φ = 859483321200.
The previous prime is 1010320240009. The next prime is 1010320240109. The reversal of 1010320240013 is 3100420230101.
It is not a de Polignac number, because 1010320240013 - 22 = 1010320240009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010320239973 and 1010320240000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010320200013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 422453 + ... + 1482938.
It is an arithmetic number, because the mean of its divisors is an integer number (72709758720).
Almost surely, 21010320240013 is an apocalyptic number.
It is an amenable number.
1010320240013 is a deficient number, since it is larger than the sum of its proper divisors (153035899507).
1010320240013 is a wasteful number, since it uses less digits than its factorization.
1010320240013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1905968.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1010320240013 its reverse (3100420230101), we get a palindrome (4110740470114).
The spelling of 1010320240013 in words is "one trillion, ten billion, three hundred twenty million, two hundred forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •