Base | Representation |
---|---|
bin | 101110100100001111… |
… | …0001100000111110101 |
3 | 100120010011212111200112 |
4 | 1131020132030013311 |
5 | 3114300012340313 |
6 | 113534525352405 |
7 | 10140045002150 |
oct | 1351036140765 |
9 | 316104774615 |
10 | 100000121333 |
11 | 39456509282 |
12 | 17469a08705 |
13 | 9578852a38 |
14 | 4ba9092c97 |
15 | 29042608a8 |
hex | 174878c1f5 |
100000121333 has 8 divisors (see below), whose sum is σ = 114551020800. Its totient is φ = 85515513840.
The previous prime is 100000121329. The next prime is 100000121387. The reversal of 100000121333 is 333121000001.
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 100000121333 - 22 = 100000121329 is a prime.
It is a super-2 number, since 2×1000001213332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000120333) 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, 16569758 + ... + 16575791.
It is an arithmetic number, because the mean of its divisors is an integer number (14318877600).
Almost surely, 2100000121333 is an apocalyptic number.
It is an amenable number.
100000121333 is a deficient number, since it is larger than the sum of its proper divisors (14550899467).
100000121333 is an equidigital number, since it uses as much as digits as its factorization.
100000121333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33145987.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 100000121333 its reverse (333121000001), we get a palindrome (433121121334).
The spelling of 100000121333 in words is "one hundred billion, one hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •