Base | Representation |
---|---|
bin | 11101101110010101101… |
… | …00100101000010111101 |
3 | 10121122011212000010001220 |
4 | 32313022310211002331 |
5 | 113213120331430023 |
6 | 2101103334223553 |
7 | 133534005006300 |
oct | 16671264450275 |
9 | 3548155003056 |
10 | 1021310030013 |
11 | 364153982949 |
12 | 145b2a7b4bb9 |
13 | 754031b0860 |
14 | 37608700b37 |
15 | 1b8775043e3 |
hex | edcad250bd |
1021310030013 has 144 divisors (see below), whose sum is σ = 1817132184000. Its totient is φ = 503991936000.
The previous prime is 1021310029991. The next prime is 1021310030093. The reversal of 1021310030013 is 3100300131201.
It is not a de Polignac number, because 1021310030013 - 213 = 1021310021821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021310029974 and 1021310030001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021310030093) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 2046713238 + ... + 2046713736.
It is an arithmetic number, because the mean of its divisors is an integer number (12618973500).
Almost surely, 21021310030013 is an apocalyptic number.
1021310030013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1021310030013 is a deficient number, since it is larger than the sum of its proper divisors (795822153987).
1021310030013 is a wasteful number, since it uses less digits than its factorization.
1021310030013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1048 (or 790 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1021310030013 its reverse (3100300131201), we get a palindrome (4121610161214).
The spelling of 1021310030013 in words is "one trillion, twenty-one billion, three hundred ten million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •