Base | Representation |
---|---|
bin | 111101101100010… |
… | …000100110001101 |
3 | 2200010120002020001 |
4 | 331230100212031 |
5 | 4104430344433 |
6 | 250411524301 |
7 | 34435314064 |
oct | 7554204615 |
9 | 2603502201 |
10 | 1035012493 |
11 | 491268229 |
12 | 24a759691 |
13 | 136578838 |
14 | 9b6631db |
15 | 60cea57d |
hex | 3db1098d |
1035012493 has 2 divisors, whose sum is σ = 1035012494. Its totient is φ = 1035012492.
The previous prime is 1035012491. The next prime is 1035012571. The reversal of 1035012493 is 3942105301.
1035012493 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 can be written as a sum of positive squares in only one way, i.e., 840884004 + 194128489 = 28998^2 + 13933^2 .
It is a cyclic number.
It is not a de Polignac number, because 1035012493 - 21 = 1035012491 is a prime.
Together with 1035012491, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1035012491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 517506246 + 517506247.
It is an arithmetic number, because the mean of its divisors is an integer number (517506247).
Almost surely, 21035012493 is an apocalyptic number.
It is an amenable number.
1035012493 is a deficient number, since it is larger than the sum of its proper divisors (1).
1035012493 is an equidigital number, since it uses as much as digits as its factorization.
1035012493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 1035012493 is about 32171.6100467477. The cubic root of 1035012493 is about 1011.5372118473.
Adding to 1035012493 its reverse (3942105301), we get a palindrome (4977117794).
The spelling of 1035012493 in words is "one billion, thirty-five million, twelve thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •