Base | Representation |
---|---|
bin | 101111100011111100… |
… | …0000010100010001001 |
3 | 100202122010220212222212 |
4 | 1133013320002202021 |
5 | 3133134211313413 |
6 | 114531003154505 |
7 | 10244031211550 |
oct | 1370770024211 |
9 | 322563825885 |
10 | 102137604233 |
11 | 3a353018875 |
12 | 17965815a35 |
13 | 9829635812 |
14 | 4d2ccd8d97 |
15 | 29cbc2dca8 |
hex | 17c7e02889 |
102137604233 has 4 divisors (see below), whose sum is σ = 116728690560. Its totient is φ = 87546517908.
The previous prime is 102137604227. The next prime is 102137604251. The reversal of 102137604233 is 332406731201.
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 102137604233 - 26 = 102137604169 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 102137604233.
It is not an unprimeable number, because it can be changed into a prime (102137604533) 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 3 ways as a sum of consecutive naturals, for example, 7295543153 + ... + 7295543166.
It is an arithmetic number, because the mean of its divisors is an integer number (29182172640).
Almost surely, 2102137604233 is an apocalyptic number.
It is an amenable number.
102137604233 is a deficient number, since it is larger than the sum of its proper divisors (14591086327).
102137604233 is an equidigital number, since it uses as much as digits as its factorization.
102137604233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14591086326.
The product of its (nonzero) digits is 18144, while the sum is 32.
The spelling of 102137604233 in words is "one hundred two billion, one hundred thirty-seven million, six hundred four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •