Base | Representation |
---|---|
bin | 101110110001001000… |
… | …1111011000000101101 |
3 | 100121020100121202202212 |
4 | 1131202101323000231 |
5 | 3121141334110013 |
6 | 114045514100205 |
7 | 10153553243003 |
oct | 1354221730055 |
9 | 317210552685 |
10 | 100433113133 |
11 | 39658968441 |
12 | 1756aa1a665 |
13 | 9617475cc2 |
14 | 4c0a7a4a73 |
15 | 292c28e6a8 |
hex | 176247b02d |
100433113133 has 4 divisors (see below), whose sum is σ = 103672891008. Its totient is φ = 97193335260.
The previous prime is 100433113127. The next prime is 100433113141. The reversal of 100433113133 is 331311334001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100433113133 - 24 = 100433113117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100433113099 and 100433113108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100433113153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1619888891 + ... + 1619888952.
It is an arithmetic number, because the mean of its divisors is an integer number (25918222752).
Almost surely, 2100433113133 is an apocalyptic number.
It is an amenable number.
100433113133 is a deficient number, since it is larger than the sum of its proper divisors (3239777875).
100433113133 is an equidigital number, since it uses as much as digits as its factorization.
100433113133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3239777874.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 100433113133 its reverse (331311334001), we get a palindrome (431744447134).
The spelling of 100433113133 in words is "one hundred billion, four hundred thirty-three million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •