Base | Representation |
---|---|
bin | 101111101000100111… |
… | …1111000111101010011 |
3 | 100210001002210212120102 |
4 | 1133101033320331103 |
5 | 3133444440221121 |
6 | 114554341403015 |
7 | 10250650614254 |
oct | 1372117707523 |
9 | 323032725512 |
10 | 102294851411 |
11 | 3a42385aa15 |
12 | 179aa40946b |
13 | 98530a129c |
14 | 4d45b4cb2b |
15 | 29da94090b |
hex | 17d13f8f53 |
102294851411 has 4 divisors (see below), whose sum is σ = 103307671824. Its totient is φ = 101282031000.
The previous prime is 102294851369. The next prime is 102294851467. The reversal of 102294851411 is 114158492201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102294851411 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102294851471) 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, 506410055 + ... + 506410256.
It is an arithmetic number, because the mean of its divisors is an integer number (25826917956).
Almost surely, 2102294851411 is an apocalyptic number.
102294851411 is a deficient number, since it is larger than the sum of its proper divisors (1012820413).
102294851411 is a wasteful number, since it uses less digits than its factorization.
102294851411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012820412.
The product of its (nonzero) digits is 23040, while the sum is 38.
The spelling of 102294851411 in words is "one hundred two billion, two hundred ninety-four million, eight hundred fifty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •