Base | Representation |
---|---|
bin | 10111001111001111111111… |
… | …011111110010001000100101 |
3 | 111101212111220010012012112122 |
4 | 113033033333133302020211 |
5 | 101343443303013031323 |
6 | 1001211231512355325 |
7 | 30345632304365534 |
oct | 2717177737621045 |
9 | 441774803165478 |
10 | 102203033330213 |
11 | 2a624076984032 |
12 | b5677710a5b45 |
13 | 450492128071a |
14 | 1b3492058431b |
15 | bc380719aec8 |
hex | 5cf3ff7f2225 |
102203033330213 has 8 divisors (see below), whose sum is σ = 106470295162560. Its totient is φ = 98020271732320.
The previous prime is 102203033330197. The next prime is 102203033330263. The reversal of 102203033330213 is 312033330302201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102203033330213 - 24 = 102203033330197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102203033330263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21125056145 + ... + 21125060982.
It is an arithmetic number, because the mean of its divisors is an integer number (13308786895320).
Almost surely, 2102203033330213 is an apocalyptic number.
It is an amenable number.
102203033330213 is a deficient number, since it is larger than the sum of its proper divisors (4267261832347).
102203033330213 is an equidigital number, since it uses as much as digits as its factorization.
102203033330213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42250117227.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 102203033330213 its reverse (312033330302201), we get a palindrome (414236363632414).
The spelling of 102203033330213 in words is "one hundred two trillion, two hundred three billion, thirty-three million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •