Base | Representation |
---|---|
bin | 101110101000001010… |
… | …1010100001111011101 |
3 | 100120110101001022001212 |
4 | 1131100111110033131 |
5 | 3120032243404041 |
6 | 114000000314205 |
7 | 10143236032055 |
oct | 1352025241735 |
9 | 316411038055 |
10 | 100132013021 |
11 | 39513a02477 |
12 | 174a6012965 |
13 | 9599c81561 |
14 | 4bbc7c6565 |
15 | 2910b148eb |
hex | 17505543dd |
100132013021 has 8 divisors (see below), whose sum is σ = 106239844800. Its totient is φ = 94048371648.
The previous prime is 100132012991. The next prime is 100132013027. The reversal of 100132013021 is 120310231001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100132013021 - 214 = 100131996637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100132012987 and 100132013005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100132013027) 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 7 ways as a sum of consecutive naturals, for example, 6039071 + ... + 6055628.
It is an arithmetic number, because the mean of its divisors is an integer number (13279980600).
Almost surely, 2100132013021 is an apocalyptic number.
It is an amenable number.
100132013021 is a deficient number, since it is larger than the sum of its proper divisors (6107831779).
100132013021 is a wasteful number, since it uses less digits than its factorization.
100132013021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12095203.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 100132013021 its reverse (120310231001), we get a palindrome (220442244022).
The spelling of 100132013021 in words is "one hundred billion, one hundred thirty-two million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •