Base | Representation |
---|---|
bin | 10111001100111010000111… |
… | …110110000101010011000011 |
3 | 111101022010112020112201201001 |
4 | 113030322013312011103003 |
5 | 101333324221200320003 |
6 | 1001005255452352431 |
7 | 30331204443564346 |
oct | 2714720766052303 |
9 | 441263466481631 |
10 | 102042112120003 |
11 | 2a5718a9072020 |
12 | b540540a75717 |
13 | 44c26b7202203 |
14 | 1b2ac1659245d |
15 | bbe5398e261d |
hex | 5cce87d854c3 |
102042112120003 has 4 divisors (see below), whose sum is σ = 111318667767288. Its totient is φ = 92765556472720.
The previous prime is 102042112119971. The next prime is 102042112120103. The reversal of 102042112120003 is 300021211240201.
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 102042112120003 - 25 = 102042112119971 is a prime.
It is a super-2 number, since 2×1020421121200032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102042112120103) 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, 4638277823626 + ... + 4638277823647.
It is an arithmetic number, because the mean of its divisors is an integer number (27829666941822).
Almost surely, 2102042112120003 is an apocalyptic number.
102042112120003 is a deficient number, since it is larger than the sum of its proper divisors (9276555647285).
102042112120003 is an equidigital number, since it uses as much as digits as its factorization.
102042112120003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9276555647284.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102042112120003 its reverse (300021211240201), we get a palindrome (402063323360204).
The spelling of 102042112120003 in words is "one hundred two trillion, forty-two billion, one hundred twelve million, one hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •