Base | Representation |
---|---|
bin | 101110110100001000… |
… | …0001110000011010101 |
3 | 100121111100012022122121 |
4 | 1131220100032003111 |
5 | 3121343013031013 |
6 | 114103454055541 |
7 | 10156211130565 |
oct | 1355020160325 |
9 | 317440168577 |
10 | 100533330133 |
11 | 396aa497a05 |
12 | 175984aa5b1 |
13 | 96321644c2 |
14 | 4c19c10da5 |
15 | 2935e8858d |
hex | 176840e0d5 |
100533330133 has 4 divisors (see below), whose sum is σ = 100589590080. Its totient is φ = 100477070188.
The previous prime is 100533330127. The next prime is 100533330137. The reversal of 100533330133 is 331033335001.
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 100533330133 - 25 = 100533330101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100533330098 and 100533330107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100533330137) 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, 28127293 + ... + 28130866.
It is an arithmetic number, because the mean of its divisors is an integer number (25147397520).
Almost surely, 2100533330133 is an apocalyptic number.
It is an amenable number.
100533330133 is a deficient number, since it is larger than the sum of its proper divisors (56259947).
100533330133 is an equidigital number, since it uses as much as digits as its factorization.
100533330133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56259946.
The product of its (nonzero) digits is 3645, while the sum is 25.
Adding to 100533330133 its reverse (331033335001), we get a palindrome (431566665134).
The spelling of 100533330133 in words is "one hundred billion, five hundred thirty-three million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •