Base | Representation |
---|---|
bin | 1001100011001100000110… |
… | …11100001000111111011101 |
3 | 2202100121110000221212110020 |
4 | 10301212003130020333131 |
5 | 10223032103334133201 |
6 | 112355223233102353 |
7 | 4265136006216555 |
oct | 461460334107735 |
9 | 82317400855406 |
10 | 21000300302301 |
11 | 67671a5053551 |
12 | 2431bba0b79b9 |
13 | b94420854b38 |
14 | 5285c4516165 |
15 | 2663ecb6aa36 |
hex | 131983708fdd |
21000300302301 has 16 divisors (see below), whose sum is σ = 29474510400000. Its totient is φ = 13263165438768.
The previous prime is 21000300302297. The next prime is 21000300302351. The reversal of 21000300302301 is 10320300300012.
It is not a de Polignac number, because 21000300302301 - 22 = 21000300302297 is a prime.
It is a super-2 number, since 2×210003003023012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000300302351) 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 15 ways as a sum of consecutive naturals, for example, 1720200 + ... + 6705198.
It is an arithmetic number, because the mean of its divisors is an integer number (1842156900000).
Almost surely, 221000300302301 is an apocalyptic number.
It is an amenable number.
21000300302301 is a deficient number, since it is larger than the sum of its proper divisors (8474210097699).
21000300302301 is a wasteful number, since it uses less digits than its factorization.
21000300302301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5058928.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 21000300302301 its reverse (10320300300012), we get a palindrome (31320600602313).
The spelling of 21000300302301 in words is "twenty-one trillion, three hundred million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •