Base | Representation |
---|---|
bin | 101110100100010001… |
… | …0101100101100100011 |
3 | 100120010021002120002020 |
4 | 1131020202230230203 |
5 | 3114300313201311 |
6 | 113535010552523 |
7 | 10140061024206 |
oct | 1351042545443 |
9 | 316107076066 |
10 | 100001303331 |
11 | 39457146336 |
12 | 1746a298743 |
13 | 9578b77a47 |
14 | 4ba92bd93d |
15 | 29043e5c06 |
hex | 17488acb23 |
100001303331 has 8 divisors (see below), whose sum is σ = 135213030144. Its totient is φ = 65728556040.
The previous prime is 100001303309. The next prime is 100001303359. The reversal of 100001303331 is 133303100001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100001303331 - 26 = 100001303267 is a prime.
It is a super-2 number, since 2×1000013033312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100001303331.
It is not an unprimeable number, because it can be changed into a prime (100001303231) 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, 234744631 + ... + 234745056.
It is an arithmetic number, because the mean of its divisors is an integer number (16901628768).
Almost surely, 2100001303331 is an apocalyptic number.
100001303331 is a deficient number, since it is larger than the sum of its proper divisors (35211726813).
100001303331 is an equidigital number, since it uses as much as digits as its factorization.
100001303331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469489761.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 100001303331 its reverse (133303100001), we get a palindrome (233304403332).
The spelling of 100001303331 in words is "one hundred billion, one million, three hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •