Base | Representation |
---|---|
bin | 11101101100101001011… |
… | …01100100100101001001 |
3 | 10121112211120210202112222 |
4 | 32312110231210211021 |
5 | 113204240432122213 |
6 | 2100433304543425 |
7 | 133502342535005 |
oct | 16662455444511 |
9 | 3545746722488 |
10 | 1020402223433 |
11 | 3638284a937a |
12 | 145916781b75 |
13 | 752ba0b2ab8 |
14 | 3755dd11705 |
15 | 1b822984808 |
hex | ed94b64949 |
1020402223433 has 2 divisors, whose sum is σ = 1020402223434. Its totient is φ = 1020402223432.
The previous prime is 1020402223331. The next prime is 1020402223441. The reversal of 1020402223433 is 3343222040201.
1020402223433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 594322271929 + 426079951504 = 770923^2 + 652748^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020402223433 - 28 = 1020402223177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1020402223493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510201111716 + 510201111717.
It is an arithmetic number, because the mean of its divisors is an integer number (510201111717).
Almost surely, 21020402223433 is an apocalyptic number.
It is an amenable number.
1020402223433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020402223433 is an equidigital number, since it uses as much as digits as its factorization.
1020402223433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 1020402223433 its reverse (3343222040201), we get a palindrome (4363624263634).
The spelling of 1020402223433 in words is "one trillion, twenty billion, four hundred two million, two hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •