Base | Representation |
---|---|
bin | 10110110011110111100000… |
… | …101001100110000110011101 |
3 | 111011012121212021211112100011 |
4 | 112303313200221212012131 |
5 | 101122131030423224041 |
6 | 553210551144203221 |
7 | 30062655556204051 |
oct | 2663674051460635 |
9 | 434177767745304 |
10 | 100321320133021 |
11 | 29a6903a930a19 |
12 | b302b3b169511 |
13 | 43c934bcb6280 |
14 | 1aab8136bbc61 |
15 | b8e8c3a64e81 |
hex | 5b3de0a6619d |
100321320133021 has 16 divisors (see below), whose sum is σ = 110372870361600. Its totient is φ = 90604553470848.
The previous prime is 100321320132907. The next prime is 100321320133037. The reversal of 100321320133021 is 120331023123001.
It is a cyclic number.
It is not a de Polignac number, because 100321320133021 - 211 = 100321320130973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100321320132983 and 100321320133001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100321320130021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24781936 + ... + 28544473.
It is an arithmetic number, because the mean of its divisors is an integer number (6898304397600).
Almost surely, 2100321320133021 is an apocalyptic number.
It is an amenable number.
100321320133021 is a deficient number, since it is larger than the sum of its proper divisors (10051550228579).
100321320133021 is a wasteful number, since it uses less digits than its factorization.
100321320133021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53329548.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 100321320133021 its reverse (120331023123001), we get a palindrome (220652343256022).
The spelling of 100321320133021 in words is "one hundred trillion, three hundred twenty-one billion, three hundred twenty million, one hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •