Base | Representation |
---|---|
bin | 100010001000010… |
… | …0110010101110011 |
3 | 2221210220021212012 |
4 | 1010100212111303 |
5 | 4321132431120 |
6 | 305345353135 |
7 | 40244025305 |
oct | 10420462563 |
9 | 2853807765 |
10 | 1145202035 |
11 | 53848926a |
12 | 27b6387ab |
13 | 153349253 |
14 | ac147975 |
15 | 6a8141c5 |
hex | 44426573 |
1145202035 has 8 divisors (see below), whose sum is σ = 1374692256. Its totient is φ = 915861760.
The previous prime is 1145202011. The next prime is 1145202041. The reversal of 1145202035 is 5302025411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1145202035 - 210 = 1145201011 is a prime.
It is a super-2 number, since 2×11452020352 = 2622975401936282450, which contains 22 as substring.
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 1145202035.
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 7 ways as a sum of consecutive naturals, for example, 19934 + ... + 51843.
It is an arithmetic number, because the mean of its divisors is an integer number (171836532).
Almost surely, 21145202035 is an apocalyptic number.
1145202035 is a deficient number, since it is larger than the sum of its proper divisors (229490221).
1145202035 is an equidigital number, since it uses as much as digits as its factorization.
1145202035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74973.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 1145202035 is about 33840.8338401996. The cubic root of 1145202035 is about 1046.2304850938.
Adding to 1145202035 its reverse (5302025411), we get a palindrome (6447227446).
The spelling of 1145202035 in words is "one billion, one hundred forty-five million, two hundred two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •