Base | Representation |
---|---|
bin | 1011001100000001111010… |
… | …1011010111100101010011 |
3 | 1121112222210211002211211221 |
4 | 2303000132223113211103 |
5 | 3103021031030133021 |
6 | 42055050100345511 |
7 | 2406511464310132 |
oct | 263003653274523 |
9 | 47488724084757 |
10 | 12301301021011 |
11 | 3a12a52806482 |
12 | 14680a89a5297 |
13 | 6b3013c230c2 |
14 | 307559829919 |
15 | 164eb9922241 |
hex | b301ead7953 |
12301301021011 has 4 divisors (see below), whose sum is σ = 12352770900000. Its totient is φ = 12249831142024.
The previous prime is 12301301020991. The next prime is 12301301021147. The reversal of 12301301021011 is 11012010310321.
It is a happy number.
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 12301301021011 - 235 = 12266941282643 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12301301021311) 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, 25734939136 + ... + 25734939613.
It is an arithmetic number, because the mean of its divisors is an integer number (3088192725000).
Almost surely, 212301301021011 is an apocalyptic number.
12301301021011 is a deficient number, since it is larger than the sum of its proper divisors (51469878989).
12301301021011 is an equidigital number, since it uses as much as digits as its factorization.
12301301021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51469878988.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 12301301021011 its reverse (11012010310321), we get a palindrome (23313311331332).
The spelling of 12301301021011 in words is "twelve trillion, three hundred one billion, three hundred one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •