Base | Representation |
---|---|
bin | 101011110011010010100… |
… | …100111101110101010011 |
3 | 101122202100202212121211202 |
4 | 223303102210331311103 |
5 | 343304000030404021 |
6 | 10222440212501415 |
7 | 430315565651351 |
oct | 53632244756523 |
9 | 11582322777752 |
10 | 3010010013011 |
11 | a605a11aa701 |
12 | 40743a31a86b |
13 | 18aac5614b21 |
14 | a59845047d1 |
15 | 5346d42da0b |
hex | 2bcd293dd53 |
3010010013011 has 4 divisors (see below), whose sum is σ = 3010092871632. Its totient is φ = 3009927154392.
The previous prime is 3010010012987. The next prime is 3010010013019. The reversal of 3010010013011 is 1103100100103.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3010010013011 is a prime.
It is a super-2 number, since 2×30100100130112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3010010012983 and 3010010013001.
It is not an unprimeable number, because it can be changed into a prime (3010010013019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41374796 + ... + 41447481.
It is an arithmetic number, because the mean of its divisors is an integer number (752523217908).
Almost surely, 23010010013011 is an apocalyptic number.
3010010013011 is a deficient number, since it is larger than the sum of its proper divisors (82858621).
3010010013011 is an equidigital number, since it uses as much as digits as its factorization.
3010010013011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82858620.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 3010010013011 its reverse (1103100100103), we get a palindrome (4113110113114).
The spelling of 3010010013011 in words is "three trillion, ten billion, ten million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •