Base | Representation |
---|---|
bin | 101111100110111111… |
… | …0110011010010101111 |
3 | 100202220021200011121021 |
4 | 1133031332303102233 |
5 | 3133341422240421 |
6 | 114545102515011 |
7 | 10246414000456 |
oct | 1371576632257 |
9 | 322807604537 |
10 | 102240040111 |
11 | 3a3a5923420 |
12 | 17993b95a67 |
13 | 984491cc71 |
14 | 4d3c761b9d |
15 | 29d5c15341 |
hex | 17cdfb34af |
102240040111 has 8 divisors (see below), whose sum is σ = 111585015504. Its totient is φ = 92903469120.
The previous prime is 102240040109. The next prime is 102240040121. The reversal of 102240040111 is 111040042201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102240040111 - 21 = 102240040109 is a prime.
It is a super-3 number, since 3×1022400401113 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102240040121) 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, 2075646 + ... + 2124331.
It is an arithmetic number, because the mean of its divisors is an integer number (13948126938).
Almost surely, 2102240040111 is an apocalyptic number.
102240040111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102240040111 is a deficient number, since it is larger than the sum of its proper divisors (9344975393).
102240040111 is a wasteful number, since it uses less digits than its factorization.
102240040111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4202201.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102240040111 its reverse (111040042201), we get a palindrome (213280082312).
The spelling of 102240040111 in words is "one hundred two billion, two hundred forty million, forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •