Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …11110011110000011101 |
3 | 10120122121210202102012221 |
4 | 32231211203303300131 |
5 | 113031032411403123 |
6 | 2052242353025341 |
7 | 133021022260450 |
oct | 16554543636035 |
9 | 3518553672187 |
10 | 1011021200413 |
11 | 35a854123994 |
12 | 143b38b55251 |
13 | 74453706ac3 |
14 | 36d10075497 |
15 | 1b4740e225d |
hex | eb658f3c1d |
1011021200413 has 16 divisors (see below), whose sum is σ = 1227424528000. Its totient is φ = 813447686592.
The previous prime is 1011021200411. The next prime is 1011021200419. The reversal of 1011021200413 is 3140021201101.
It is a cyclic number.
It is not a de Polignac number, because 1011021200413 - 21 = 1011021200411 is a prime.
It is a super-2 number, since 2×10110212004132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011021200411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34855518 + ... + 34884511.
It is an arithmetic number, because the mean of its divisors is an integer number (76714033000).
Almost surely, 21011021200413 is an apocalyptic number.
It is an amenable number.
1011021200413 is a deficient number, since it is larger than the sum of its proper divisors (216403327587).
1011021200413 is a wasteful number, since it uses less digits than its factorization.
1011021200413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69740164.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1011021200413 its reverse (3140021201101), we get a palindrome (4151042401514).
The spelling of 1011021200413 in words is "one trillion, eleven billion, twenty-one million, two hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •