Base | Representation |
---|---|
bin | 100010000111111… |
… | …1010001110010111 |
3 | 2221210120002222121 |
4 | 1010033322032113 |
5 | 4321111140320 |
6 | 305341440411 |
7 | 40242343423 |
oct | 10417721627 |
9 | 2853502877 |
10 | 1145021335 |
11 | 538375527 |
12 | 27b570107 |
13 | 1532b4c23 |
14 | ac0dbb83 |
15 | 6a7ca8aa |
hex | 443fa397 |
1145021335 has 8 divisors (see below), whose sum is σ = 1375289280. Its totient is φ = 915174624.
The previous prime is 1145021333. The next prime is 1145021359. The reversal of 1145021335 is 5331205411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1145021335 - 21 = 1145021333 is a prime.
It is a super-2 number, since 2×11450213352 = 2622147715210364450, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145021333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 99295 + ... + 110224.
It is an arithmetic number, because the mean of its divisors is an integer number (171911160).
Almost surely, 21145021335 is an apocalyptic number.
1145021335 is a deficient number, since it is larger than the sum of its proper divisors (230267945).
1145021335 is a wasteful number, since it uses less digits than its factorization.
1145021335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210617.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 1145021335 is about 33838.1638834024. The cubic root of 1145021335 is about 1046.1754543984.
Adding to 1145021335 its reverse (5331205411), we get a palindrome (6476226746).
The spelling of 1145021335 in words is "one billion, one hundred forty-five million, twenty-one thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •