Base | Representation |
---|---|
bin | 1001000110001001110010… |
… | …1101110111000111010011 |
3 | 1022102010010201010022200100 |
4 | 2101202130231313013103 |
5 | 2302330142130224021 |
6 | 33134312334023443 |
7 | 2051366601653364 |
oct | 221423455670723 |
9 | 38363121108610 |
10 | 10001313133011 |
11 | 3206595591312 |
12 | 11563a3647b83 |
13 | 5771732110c5 |
14 | 2680cd6abb6b |
15 | 125255379626 |
hex | 9189cb771d3 |
10001313133011 has 12 divisors (see below), whose sum is σ = 14446823978392. Its totient is φ = 6667319264256.
The previous prime is 10001313132997. The next prime is 10001313133043. The reversal of 10001313133011 is 11033131310001.
10001313133011 is a `hidden beast` number, since 10 + 0 + 0 + 1 + 313 + 1 + 330 + 11 = 666.
It is not a de Polignac number, because 10001313133011 - 218 = 10001312870867 is a prime.
It is a super-2 number, since 2×100013131330112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10001313133211) 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 11 ways as a sum of consecutive naturals, for example, 18284206 + ... + 18823251.
Almost surely, 210001313133011 is an apocalyptic number.
10001313133011 is a deficient number, since it is larger than the sum of its proper divisors (4445510845381).
10001313133011 is a wasteful number, since it uses less digits than its factorization.
10001313133011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37137410 (or 37137407 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 10001313133011 its reverse (11033131310001), we get a palindrome (21034444443012).
The spelling of 10001313133011 in words is "ten trillion, one billion, three hundred thirteen million, one hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •