Base | Representation |
---|---|
bin | 11110010001100011111… |
… | …01001101000010111001 |
3 | 10200102222201211222000121 |
4 | 33020301331031002321 |
5 | 114020332333312213 |
6 | 2113512013133241 |
7 | 135103424632342 |
oct | 17106175150271 |
9 | 3612881758017 |
10 | 1040220213433 |
11 | 371178212605 |
12 | 14972778a221 |
13 | 77127b619bb |
14 | 384bdd790c9 |
15 | 1c0d274b88d |
hex | f231f4d0b9 |
1040220213433 has 2 divisors, whose sum is σ = 1040220213434. Its totient is φ = 1040220213432.
The previous prime is 1040220213353. The next prime is 1040220213437. The reversal of 1040220213433 is 3343120220401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 521923888249 + 518296325184 = 722443^2 + 719928^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1040220213433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1040220213398 and 1040220213407.
It is not a weakly prime, because it can be changed into another prime (1040220213437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520110106716 + 520110106717.
It is an arithmetic number, because the mean of its divisors is an integer number (520110106717).
Almost surely, 21040220213433 is an apocalyptic number.
It is an amenable number.
1040220213433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1040220213433 is an equidigital number, since it uses as much as digits as its factorization.
1040220213433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 1040220213433 its reverse (3343120220401), we get a palindrome (4383340433834).
The spelling of 1040220213433 in words is "one trillion, forty billion, two hundred twenty million, two hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •