Base | Representation |
---|---|
bin | 101110101000001101… |
… | …0001110101110000001 |
3 | 100120110110110202000021 |
4 | 1131100122032232001 |
5 | 3120033111113441 |
6 | 114000044053441 |
7 | 10143253005340 |
oct | 1352032165601 |
9 | 316413422007 |
10 | 100133301121 |
11 | 39514702217 |
12 | 174a6534281 |
13 | 959a312949 |
14 | 4bbca3db57 |
15 | 2910cbb3d1 |
hex | 175068eb81 |
100133301121 has 8 divisors (see below), whose sum is σ = 114702353024. Its totient is φ = 85630322880.
The previous prime is 100133301113. The next prime is 100133301131. The reversal of 100133301121 is 121103331001.
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 100133301121 - 23 = 100133301113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100133301095 and 100133301104.
It is not an unprimeable number, because it can be changed into a prime (100133301131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16515165 + ... + 16521226.
It is an arithmetic number, because the mean of its divisors is an integer number (14337794128).
Almost surely, 2100133301121 is an apocalyptic number.
It is an amenable number.
100133301121 is a deficient number, since it is larger than the sum of its proper divisors (14569051903).
100133301121 is an equidigital number, since it uses as much as digits as its factorization.
100133301121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33036831.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 100133301121 its reverse (121103331001), we get a palindrome (221236632122).
The spelling of 100133301121 in words is "one hundred billion, one hundred thirty-three million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •