Base | Representation |
---|---|
bin | 10011001111101111000101… |
… | …00001100010101101000001 |
3 | 12112211221202211121102001221 |
4 | 21213313202201202231001 |
5 | 21021401141440224301 |
6 | 230002302125155041 |
7 | 11625446263500565 |
oct | 1147674241425501 |
9 | 175757684542057 |
10 | 42322113211201 |
11 | 1253778663300a |
12 | 48b63860bba81 |
13 | 1a7cc5c09a595 |
14 | a64588cbb6a5 |
15 | 4d5d668eada1 |
hex | 267de2862b41 |
42322113211201 has 2 divisors, whose sum is σ = 42322113211202. Its totient is φ = 42322113211200.
The previous prime is 42322113211193. The next prime is 42322113211223. The reversal of 42322113211201 is 10211231122324.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23202910963600 + 19119202247601 = 4816940^2 + 4372551^2 .
It is a cyclic number.
It is not a de Polignac number, because 42322113211201 - 23 = 42322113211193 is a prime.
It is a super-2 number, since 2×423221132112012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (42322113218201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21161056605600 + 21161056605601.
It is an arithmetic number, because the mean of its divisors is an integer number (21161056605601).
Almost surely, 242322113211201 is an apocalyptic number.
It is an amenable number.
42322113211201 is a deficient number, since it is larger than the sum of its proper divisors (1).
42322113211201 is an equidigital number, since it uses as much as digits as its factorization.
42322113211201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 42322113211201 its reverse (10211231122324), we get a palindrome (52533344333525).
The spelling of 42322113211201 in words is "forty-two trillion, three hundred twenty-two billion, one hundred thirteen million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •