Base | Representation |
---|---|
bin | 10111010010101110111100… |
… | …101001110000011111101011 |
3 | 111102201101211002100010000011 |
4 | 113102232330221300133223 |
5 | 101411404044042240133 |
6 | 1001513222550552351 |
7 | 30402135626012062 |
oct | 2722567451603753 |
9 | 442641732303004 |
10 | 102442430040043 |
11 | 2a7066550a8455 |
12 | b5a60426686b7 |
13 | 4521383673b02 |
14 | 1b42350a711d9 |
15 | bc9b691896cd |
hex | 5d2bbca707eb |
102442430040043 has 4 divisors (see below), whose sum is σ = 102442704487480. Its totient is φ = 102442155592608.
The previous prime is 102442430040029. The next prime is 102442430040053. The reversal of 102442430040043 is 340040034244201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102442430040043 - 245 = 67258057951211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102442430039987 and 102442430040014.
It is not an unprimeable number, because it can be changed into a prime (102442430040053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 136663053 + ... + 137410606.
It is an arithmetic number, because the mean of its divisors is an integer number (25610676121870).
Almost surely, 2102442430040043 is an apocalyptic number.
102442430040043 is a deficient number, since it is larger than the sum of its proper divisors (274447437).
102442430040043 is an equidigital number, since it uses as much as digits as its factorization.
102442430040043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274447436.
The product of its (nonzero) digits is 36864, while the sum is 31.
Adding to 102442430040043 its reverse (340040034244201), we get a palindrome (442482464284244).
The spelling of 102442430040043 in words is "one hundred two trillion, four hundred forty-two billion, four hundred thirty million, forty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •