Base | Representation |
---|---|
bin | 10010111010111011110… |
… | …011101101110111101011 |
3 | 11121022010100001111002212 |
4 | 102322323303231313223 |
5 | 132300333120120021 |
6 | 2433152355115335 |
7 | 162636636213200 |
oct | 22727363556753 |
9 | 4538110044085 |
10 | 1300231020011 |
11 | 461474571a20 |
12 | 18bbb08a2b4b |
13 | 957c3c22a81 |
14 | 46d08123ca7 |
15 | 23c4e35a85b |
hex | 12ebbceddeb |
1300231020011 has 12 divisors (see below), whose sum is σ = 1650014875800. Its totient is φ = 1013167028160.
The previous prime is 1300231019993. The next prime is 1300231020019. The reversal of 1300231020011 is 1100201320031.
It is not a de Polignac number, because 1300231020011 - 218 = 1300230757867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1300231020019) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1206150686 + ... + 1206151763.
It is an arithmetic number, because the mean of its divisors is an integer number (137501239650).
Almost surely, 21300231020011 is an apocalyptic number.
1300231020011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1300231020011 is a deficient number, since it is larger than the sum of its proper divisors (349783855789).
1300231020011 is a wasteful number, since it uses less digits than its factorization.
1300231020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2412302474 (or 2412302467 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1300231020011 its reverse (1100201320031), we get a palindrome (2400432340042).
It can be divided in two parts, 13002 and 31020011, that added together give a palindrome (31033013).
The spelling of 1300231020011 in words is "one trillion, three hundred billion, two hundred thirty-one million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.548 sec. • engine limits •