Base | Representation |
---|---|
bin | 1001010111100011101100… |
… | …0010001010110010000001 |
3 | 1100110200221011001120112110 |
4 | 2111320323002022302001 |
5 | 2322230024413000001 |
6 | 33523522543445533 |
7 | 2112113403255315 |
oct | 225707302126201 |
9 | 40420834046473 |
10 | 10300322000001 |
11 | 3311384270720 |
12 | 11a4330bb68a9 |
13 | 5994158b8777 |
14 | 278776d2db45 |
15 | 12ce05a093d6 |
hex | 95e3b08ac81 |
10300322000001 has 16 divisors (see below), whose sum is σ = 14990559568128. Its totient is φ = 6239172301200.
The previous prime is 10300321999963. The next prime is 10300322000069. The reversal of 10300322000001 is 10000022300301.
It is a happy number.
It is not a de Polignac number, because 10300322000001 - 210 = 10300321998977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10300322000081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86116651 + ... + 86236176.
It is an arithmetic number, because the mean of its divisors is an integer number (936909973008).
Almost surely, 210300322000001 is an apocalyptic number.
10300322000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10300322000001 is a deficient number, since it is larger than the sum of its proper divisors (4690237568127).
10300322000001 is a wasteful number, since it uses less digits than its factorization.
10300322000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172354652.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 10300322000001 its reverse (10000022300301), we get a palindrome (20300344300302).
The spelling of 10300322000001 in words is "ten trillion, three hundred billion, three hundred twenty-two million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •