Base | Representation |
---|---|
bin | 110000000100010011101010… |
… | …110110010101100111110011 |
3 | 1000201111212002220210021122222 |
4 | 300010103222312111213303 |
5 | 210202103231442001003 |
6 | 2025340502142551255 |
7 | 62346210225625205 |
oct | 6004235266254763 |
9 | 1021455086707588 |
10 | 211402230422003 |
11 | 613a5200912725 |
12 | 1b86320329852b |
13 | 90c61b61449aa |
14 | 3a2bccb678775 |
15 | 19690ccd6cc38 |
hex | c044ead959f3 |
211402230422003 has 2 divisors, whose sum is σ = 211402230422004. Its totient is φ = 211402230422002.
The previous prime is 211402230421979. The next prime is 211402230422177. The reversal of 211402230422003 is 300224032204112.
211402230422003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211402230422003 - 28 = 211402230421747 is a prime.
It is a super-2 number, since 2×2114022304220032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211402290422003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105701115211001 + 105701115211002.
It is an arithmetic number, because the mean of its divisors is an integer number (105701115211002).
Almost surely, 2211402230422003 is an apocalyptic number.
211402230422003 is a deficient number, since it is larger than the sum of its proper divisors (1).
211402230422003 is an equidigital number, since it uses as much as digits as its factorization.
211402230422003 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 211402230422003 its reverse (300224032204112), we get a palindrome (511626262626115).
The spelling of 211402230422003 in words is "two hundred eleven trillion, four hundred two billion, two hundred thirty million, four hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •