Base | Representation |
---|---|
bin | 101101111011101100100100… |
… | …101100000110111110011011 |
3 | 222111021101111000222001201222 |
4 | 231323230210230012332123 |
5 | 202434300443442410133 |
6 | 1553352045114002255 |
7 | 60360026132403641 |
oct | 5573544454067633 |
9 | 874241430861658 |
10 | 202014402310043 |
11 | 59405910665904 |
12 | 1a7a78b271638b |
13 | 8894b515a1cab |
14 | 37c5799193191 |
15 | 1854cd166ce98 |
hex | b7bb24b06f9b |
202014402310043 has 4 divisors (see below), whose sum is σ = 202143320245440. Its totient is φ = 201885484374648.
The previous prime is 202014402309971. The next prime is 202014402310099. The reversal of 202014402310043 is 340013204410202.
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 202014402310043 - 238 = 201739524403099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202014402309994 and 202014402310021.
It is not an unprimeable number, because it can be changed into a prime (202014402313043) 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, 64458965348 + ... + 64458968481.
It is an arithmetic number, because the mean of its divisors is an integer number (50535830061360).
Almost surely, 2202014402310043 is an apocalyptic number.
202014402310043 is a deficient number, since it is larger than the sum of its proper divisors (128917935397).
202014402310043 is a wasteful number, since it uses less digits than its factorization.
202014402310043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128917935396.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 202014402310043 its reverse (340013204410202), we get a palindrome (542027606720245).
The spelling of 202014402310043 in words is "two hundred two trillion, fourteen billion, four hundred two million, three hundred ten thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •