Base | Representation |
---|---|
bin | 101111100110110000… |
… | …0001101010010100101 |
3 | 100202212201120201021001 |
4 | 1133031200031102211 |
5 | 3133332344121013 |
6 | 114544214553301 |
7 | 10246255555555 |
oct | 1371540152245 |
9 | 322781521231 |
10 | 102232020133 |
11 | 3a3a1345941 |
12 | 17991368831 |
13 | 9843072709 |
14 | 4d3b675165 |
15 | 29d517dddd |
hex | 17cd80d4a5 |
102232020133 has 4 divisors (see below), whose sum is σ = 102234359808. Its totient is φ = 102229680460.
The previous prime is 102232020109. The next prime is 102232020139. The reversal of 102232020133 is 331020232201.
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 102232020133 - 213 = 102232011941 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102232020133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102232020139) 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, 1103023 + ... + 1192108.
It is an arithmetic number, because the mean of its divisors is an integer number (25558589952).
Almost surely, 2102232020133 is an apocalyptic number.
It is an amenable number.
102232020133 is a deficient number, since it is larger than the sum of its proper divisors (2339675).
102232020133 is an equidigital number, since it uses as much as digits as its factorization.
102232020133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2339674.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 102232020133 its reverse (331020232201), we get a palindrome (433252252334).
The spelling of 102232020133 in words is "one hundred two billion, two hundred thirty-two million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •