Base | Representation |
---|---|
bin | 111110010010111… |
… | …011101011111000 |
3 | 2200211122010220011 |
4 | 332102323223320 |
5 | 4120024303311 |
6 | 251413111304 |
7 | 34620426610 |
oct | 7622735370 |
9 | 2624563804 |
10 | 1045150456 |
11 | 496a62009 |
12 | 252028534 |
13 | 1386b812c |
14 | 9cb41a40 |
15 | 61b4e321 |
hex | 3e4bbaf8 |
1045150456 has 32 divisors (see below), whose sum is σ = 2244228480. Its totient is φ = 446997600.
The previous prime is 1045150441. The next prime is 1045150471. The reversal of 1045150456 is 6540515401.
It is an interprime number because it is at equal distance from previous prime (1045150441) and next prime (1045150471).
It is a super-3 number, since 3×10451504563 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8491 + ... + 46501.
It is an arithmetic number, because the mean of its divisors is an integer number (70132140).
Almost surely, 21045150456 is an apocalyptic number.
It is an amenable number.
1045150456 is an abundant number, since it is smaller than the sum of its proper divisors (1199078024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1045150456 is a wasteful number, since it uses less digits than its factorization.
1045150456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38515 (or 38511 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
The square root of 1045150456 is about 32328.7868006209. The cubic root of 1045150456 is about 1014.8291609871.
Adding to 1045150456 its reverse (6540515401), we get a palindrome (7585665857).
The spelling of 1045150456 in words is "one billion, forty-five million, one hundred fifty thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •