Base | Representation |
---|---|
bin | 100010001000001… |
… | …0010110011110011 |
3 | 2221210202020010020 |
4 | 1010100102303303 |
5 | 4321122401120 |
6 | 305343534523 |
7 | 40243243131 |
oct | 10420226363 |
9 | 2853666106 |
10 | 1145122035 |
11 | 538434152 |
12 | 27b5ba443 |
13 | 15331ba05 |
14 | ac126751 |
15 | 6a7ea640 |
hex | 44412cf3 |
1145122035 has 32 divisors (see below), whose sum is σ = 1888634880. Its totient is φ = 592128768.
The previous prime is 1145122003. The next prime is 1145122049. The reversal of 1145122035 is 5302215411.
It is a happy number.
It is not a de Polignac number, because 1145122035 - 25 = 1145122003 is a prime.
It is a super-2 number, since 2×11451220352 = 2622608950085082450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1145121996 and 1145122014.
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 31 ways as a sum of consecutive naturals, for example, 81886 + ... + 94844.
It is an arithmetic number, because the mean of its divisors is an integer number (59019840).
Almost surely, 21145122035 is an apocalyptic number.
1145122035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1145122035 is a deficient number, since it is larger than the sum of its proper divisors (743512845).
1145122035 is a wasteful number, since it uses less digits than its factorization.
1145122035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13147.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1145122035 is about 33839.6518155846. The cubic root of 1145122035 is about 1046.2061224674.
Adding to 1145122035 its reverse (5302215411), we get a palindrome (6447337446).
The spelling of 1145122035 in words is "one billion, one hundred forty-five million, one hundred twenty-two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •