Base | Representation |
---|---|
bin | 101101111101001000100000… |
… | …111011010101101100001101 |
3 | 222111121211022002012011001011 |
4 | 231331020200323111230031 |
5 | 202442410134100111141 |
6 | 1553505253114245221 |
7 | 60400122420232333 |
oct | 5575104073255415 |
9 | 874554262164034 |
10 | 202113123441421 |
11 | 59443770116a95 |
12 | 1a802a64126811 |
13 | 88a1255164b2a |
14 | 37ca482433b53 |
15 | 185765d48d881 |
hex | b7d220ed5b0d |
202113123441421 has 8 divisors (see below), whose sum is σ = 202360772534400. Its totient is φ = 201865559798832.
The previous prime is 202113123441367. The next prime is 202113123441431. The reversal of 202113123441421 is 124144321311202.
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 202113123441421 - 231 = 202110975957773 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202113123441431) 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, 16628521 + ... + 26090878.
It is an arithmetic number, because the mean of its divisors is an integer number (25295096566800).
Almost surely, 2202113123441421 is an apocalyptic number.
It is an amenable number.
202113123441421 is a deficient number, since it is larger than the sum of its proper divisors (247649092979).
202113123441421 is an equidigital number, since it uses as much as digits as its factorization.
202113123441421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42725195.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 202113123441421 its reverse (124144321311202), we get a palindrome (326257444752623).
The spelling of 202113123441421 in words is "two hundred two trillion, one hundred thirteen billion, one hundred twenty-three million, four hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •