Base | Representation |
---|---|
bin | 10111010001001000001001… |
… | …000000111101001011101011 |
3 | 111102022211212221211200200201 |
4 | 113101020021000331023223 |
5 | 101403102010230240133 |
6 | 1001350405141013031 |
7 | 30361150253336224 |
oct | 2721101100751353 |
9 | 442284787750621 |
10 | 102332042040043 |
11 | 2a673858a39192 |
12 | b5887759b4177 |
13 | 4513b4097760a |
14 | 1b3ac7c12c24b |
15 | bc6d57e9dd7d |
hex | 5d120903d2eb |
102332042040043 has 8 divisors (see below), whose sum is σ = 102433262833440. Its totient is φ = 102230823192960.
The previous prime is 102332042039947. The next prime is 102332042040049. The reversal of 102332042040043 is 340040240233201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102332042040043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102332042039993 and 102332042040020.
It is not an unprimeable number, because it can be changed into a prime (102332042040049) 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, 119273571 + ... + 120128467.
It is an arithmetic number, because the mean of its divisors is an integer number (12804157854180).
Almost surely, 2102332042040043 is an apocalyptic number.
102332042040043 is a deficient number, since it is larger than the sum of its proper divisors (101220793397).
102332042040043 is a wasteful number, since it uses less digits than its factorization.
102332042040043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 973157.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 102332042040043 its reverse (340040240233201), we get a palindrome (442372282273244).
The spelling of 102332042040043 in words is "one hundred two trillion, three hundred thirty-two billion, forty-two million, forty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •