Base | Representation |
---|---|
bin | 101111100001000101… |
… | …1110001000110011101 |
3 | 100202101111020101211210 |
4 | 1133002023301012131 |
5 | 3132440240044123 |
6 | 114513312335033 |
7 | 10241461434003 |
oct | 1370213610635 |
9 | 322344211753 |
10 | 102042112413 |
11 | 3a30412640a |
12 | 17939844479 |
13 | 981290cc97 |
14 | 4d2035ca73 |
15 | 29c3669e93 |
hex | 17c22f119d |
102042112413 has 8 divisors (see below), whose sum is σ = 137094746976. Its totient is φ = 67508776400.
The previous prime is 102042112387. The next prime is 102042112423. The reversal of 102042112413 is 314211240201.
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 102042112413 - 28 = 102042112157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102042112413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102042112423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 129824178 + ... + 129824963.
It is an arithmetic number, because the mean of its divisors is an integer number (17136843372).
Almost surely, 2102042112413 is an apocalyptic number.
It is an amenable number.
102042112413 is a deficient number, since it is larger than the sum of its proper divisors (35052634563).
102042112413 is a wasteful number, since it uses less digits than its factorization.
102042112413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259649275.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 102042112413 its reverse (314211240201), we get a palindrome (416253352614).
The spelling of 102042112413 in words is "one hundred two billion, forty-two million, one hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •