Base | Representation |
---|---|
bin | 101110101101111100… |
… | …1101110001110100101 |
3 | 100120221220021020121111 |
4 | 1131123321232032211 |
5 | 3120431440343041 |
6 | 114031132345021 |
7 | 10151113554631 |
oct | 1353371561645 |
9 | 316856236544 |
10 | 100326106021 |
11 | 39603520409 |
12 | 1753b015171 |
13 | 95cb24ac9b |
14 | 4bda4abdc1 |
15 | 2922ba3981 |
hex | 175be6e3a5 |
100326106021 has 2 divisors, whose sum is σ = 100326106022. Its totient is φ = 100326106020.
The previous prime is 100326105977. The next prime is 100326106073. The reversal of 100326106021 is 120601623001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69450696225 + 30875409796 = 263535^2 + 175714^2 .
It is a cyclic number.
It is not a de Polignac number, because 100326106021 - 225 = 100292551589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100326105983 and 100326106001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100326106921) 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 as a sum of consecutive naturals, namely, 50163053010 + 50163053011.
It is an arithmetic number, because the mean of its divisors is an integer number (50163053011).
Almost surely, 2100326106021 is an apocalyptic number.
It is an amenable number.
100326106021 is a deficient number, since it is larger than the sum of its proper divisors (1).
100326106021 is an equidigital number, since it uses as much as digits as its factorization.
100326106021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 100326106021 its reverse (120601623001), we get a palindrome (220927729022).
The spelling of 100326106021 in words is "one hundred billion, three hundred twenty-six million, one hundred six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •