Base | Representation |
---|---|
bin | 101111100110110010… |
… | …1001000111110111101 |
3 | 100202212211000102000220 |
4 | 1133031211020332331 |
5 | 3133333212010323 |
6 | 114544302411553 |
7 | 10246302552513 |
oct | 1371545107675 |
9 | 322784012026 |
10 | 102233313213 |
11 | 3a3a20493a9 |
12 | 17991890bb9 |
13 | 9843406155 |
14 | 4d3b8d04b3 |
15 | 29d53370e3 |
hex | 17cd948fbd |
102233313213 has 4 divisors (see below), whose sum is σ = 136311084288. Its totient is φ = 68155542140.
The previous prime is 102233313197. The next prime is 102233313233. The reversal of 102233313213 is 312313332201.
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 102233313213 - 24 = 102233313197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102233313233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17038885533 + ... + 17038885538.
It is an arithmetic number, because the mean of its divisors is an integer number (34077771072).
Almost surely, 2102233313213 is an apocalyptic number.
It is an amenable number.
102233313213 is a deficient number, since it is larger than the sum of its proper divisors (34077771075).
102233313213 is an equidigital number, since it uses as much as digits as its factorization.
102233313213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34077771074.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 102233313213 its reverse (312313332201), we get a palindrome (414546645414).
The spelling of 102233313213 in words is "one hundred two billion, two hundred thirty-three million, three hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •