Base | Representation |
---|---|
bin | 111100011001001… |
… | …000110000100011 |
3 | 2121121120000212212 |
4 | 330121020300203 |
5 | 4033341104220 |
6 | 244312512335 |
7 | 34052151161 |
oct | 7431106043 |
9 | 2547500785 |
10 | 1013222435 |
11 | 47aa35015 |
12 | 2433ab6ab |
13 | 131bb9704 |
14 | 987d0231 |
15 | 5de440c5 |
hex | 3c648c23 |
1013222435 has 4 divisors (see below), whose sum is σ = 1215866928. Its totient is φ = 810577944.
The previous prime is 1013222429. The next prime is 1013222477. The reversal of 1013222435 is 5342223101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5342223101 = 64483 ⋅82847.
It is a cyclic number.
It is not a de Polignac number, because 1013222435 - 210 = 1013221411 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1013222435.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101322239 + ... + 101322248.
It is an arithmetic number, because the mean of its divisors is an integer number (303966732).
Almost surely, 21013222435 is an apocalyptic number.
1013222435 is a deficient number, since it is larger than the sum of its proper divisors (202644493).
1013222435 is an equidigital number, since it uses as much as digits as its factorization.
1013222435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202644492.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 1013222435 is about 31831.1550999960. The cubic root of 1013222435 is about 1004.3881939207.
Adding to 1013222435 its reverse (5342223101), we get a palindrome (6355445536).
The spelling of 1013222435 in words is "one billion, thirteen million, two hundred twenty-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •