Base | Representation |
---|---|
bin | 101111100101110111… |
… | …0111100110101000001 |
3 | 100202210122201022122112 |
4 | 1133023232330311001 |
5 | 3133302244033213 |
6 | 114541234345105 |
7 | 10245445321640 |
oct | 1371356746501 |
9 | 322718638575 |
10 | 102202330433 |
11 | 3a3866075a5 |
12 | 1798342b195 |
13 | 9839b78a48 |
14 | 4d37747357 |
15 | 29d2766ea8 |
hex | 17cbbbcd41 |
102202330433 has 8 divisors (see below), whose sum is σ = 116845454400. Its totient is φ = 87569904240.
The previous prime is 102202330423. The next prime is 102202330463. The reversal of 102202330433 is 334033202201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102202330433 - 212 = 102202326337 is a prime.
It is a super-2 number, since 2×1022023304332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102202330399 and 102202330408.
It is not an unprimeable number, because it can be changed into a prime (102202330403) 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, 2653958 + ... + 2692191.
It is an arithmetic number, because the mean of its divisors is an integer number (14605681800).
Almost surely, 2102202330433 is an apocalyptic number.
It is an amenable number.
102202330433 is a deficient number, since it is larger than the sum of its proper divisors (14643123967).
102202330433 is an equidigital number, since it uses as much as digits as its factorization.
102202330433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5348887.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 102202330433 its reverse (334033202201), we get a palindrome (436235532634).
The spelling of 102202330433 in words is "one hundred two billion, two hundred two million, three hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •