Base | Representation |
---|---|
bin | 101111100110111111… |
… | …1110011111010111111 |
3 | 100202220022011121201201 |
4 | 1133031333303322333 |
5 | 3133342004223311 |
6 | 114545112320331 |
7 | 10246416152320 |
oct | 1371577637277 |
9 | 322808147651 |
10 | 102240304831 |
11 | 3a3a5a942a5 |
12 | 179940a30a7 |
13 | 98449b35c2 |
14 | 4d3c7d0447 |
15 | 29d5c689c1 |
hex | 17cdff3ebf |
102240304831 has 8 divisors (see below), whose sum is σ = 118761572384. Its totient is φ = 86197914720.
The previous prime is 102240304807. The next prime is 102240304861. The reversal of 102240304831 is 138403042201.
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 102240304831 - 223 = 102231916223 is a prime.
It is a super-2 number, since 2×1022403048312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102240304831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102240304861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119718900 + ... + 119719753.
It is an arithmetic number, because the mean of its divisors is an integer number (14845196548).
Almost surely, 2102240304831 is an apocalyptic number.
102240304831 is a deficient number, since it is larger than the sum of its proper divisors (16521267553).
102240304831 is an equidigital number, since it uses as much as digits as its factorization.
102240304831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239438721.
The product of its (nonzero) digits is 4608, while the sum is 28.
The spelling of 102240304831 in words is "one hundred two billion, two hundred forty million, three hundred four thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •