Base | Representation |
---|---|
bin | 11101011111011110101… |
… | …11000101010000001011 |
3 | 10120212120221001002200201 |
4 | 32233233113011100023 |
5 | 113100301234320021 |
6 | 2053304021313031 |
7 | 133132224255022 |
oct | 16575727052013 |
9 | 3525527032621 |
10 | 1013333120011 |
11 | 360830146343 |
12 | 144483265777 |
13 | 74731693474 |
14 | 3708d1278b9 |
15 | 1b55c06a591 |
hex | ebef5c540b |
1013333120011 has 4 divisors (see below), whose sum is σ = 1013337090472. Its totient is φ = 1013329149552.
The previous prime is 1013333119987. The next prime is 1013333120017. The reversal of 1013333120011 is 1100213333101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1013333120011 - 211 = 1013333117963 is a prime.
It is a super-2 number, since 2×10133331200112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013333120017) 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 3 ways as a sum of consecutive naturals, for example, 1574010 + ... + 2122303.
It is an arithmetic number, because the mean of its divisors is an integer number (253334272618).
Almost surely, 21013333120011 is an apocalyptic number.
1013333120011 is a deficient number, since it is larger than the sum of its proper divisors (3970461).
1013333120011 is an equidigital number, since it uses as much as digits as its factorization.
1013333120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3970460.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1013333120011 its reverse (1100213333101), we get a palindrome (2113546453112).
The spelling of 1013333120011 in words is "one trillion, thirteen billion, three hundred thirty-three million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •