Base | Representation |
---|---|
bin | 101110101000001100… |
… | …1011101101001000111 |
3 | 100120110110002112021011 |
4 | 1131100121131221013 |
5 | 3120033033200403 |
6 | 114000035503051 |
7 | 10143251210311 |
oct | 1352031355107 |
9 | 316413075234 |
10 | 100133100103 |
11 | 39514585193 |
12 | 174a6457a87 |
13 | 959a2722ba |
14 | 4bbc9ca7b1 |
15 | 2910c7ba6d |
hex | 175065da47 |
100133100103 has 8 divisors (see below), whose sum is σ = 106026476688. Its totient is φ = 94240078464.
The previous prime is 100133100101. The next prime is 100133100139. The reversal of 100133100103 is 301001331001.
It is a happy number.
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 100133100103 - 21 = 100133100101 is a prime.
It is a super-2 number, since 2×1001331001032 (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 (100133100101) 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, 684825 + ... + 818077.
It is an arithmetic number, because the mean of its divisors is an integer number (13253309586).
Almost surely, 2100133100103 is an apocalyptic number.
100133100103 is a deficient number, since it is larger than the sum of its proper divisors (5893376585).
100133100103 is a wasteful number, since it uses less digits than its factorization.
100133100103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177473.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 100133100103 its reverse (301001331001), we get a palindrome (401134431104).
The spelling of 100133100103 in words is "one hundred billion, one hundred thirty-three million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •