Base | Representation |
---|---|
bin | 1001010001111011011100… |
… | …1101110000010101110001 |
3 | 1100010110022220101011000211 |
4 | 2110132313031300111301 |
5 | 2314134004004230101 |
6 | 33411251233144121 |
7 | 2102121146602030 |
oct | 224366715602561 |
9 | 40113286334024 |
10 | 10203621164401 |
11 | 3284371159675 |
12 | 11896440bb041 |
13 | 590274757c12 |
14 | 273c0210c717 |
15 | 12a646259c51 |
hex | 947b7370571 |
10203621164401 has 16 divisors (see below), whose sum is σ = 12066238627200. Its totient is φ = 8442385233408.
The previous prime is 10203621164383. The next prime is 10203621164447. The reversal of 10203621164401 is 10446112630201.
It is not a de Polignac number, because 10203621164401 - 215 = 10203621131633 is a prime.
It is a super-2 number, since 2×102036211644012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10203621164201) 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, 5061856 + ... + 6784513.
It is an arithmetic number, because the mean of its divisors is an integer number (754139914200).
Almost surely, 210203621164401 is an apocalyptic number.
It is an amenable number.
10203621164401 is a deficient number, since it is larger than the sum of its proper divisors (1862617462799).
10203621164401 is a wasteful number, since it uses less digits than its factorization.
10203621164401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11850648.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 10203621164401 its reverse (10446112630201), we get a palindrome (20649733794602).
The spelling of 10203621164401 in words is "ten trillion, two hundred three billion, six hundred twenty-one million, one hundred sixty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •