Base | Representation |
---|---|
bin | 101011001110000… |
… | …1111010011110010 |
3 | 10202001212222211100 |
4 | 1112130033103302 |
5 | 10432230241224 |
6 | 355523425230 |
7 | 50636602422 |
oct | 12634172362 |
9 | 3661788740 |
10 | 1450243314 |
11 | 6846962a3 |
12 | 345825216 |
13 | 1a15c0850 |
14 | da870482 |
15 | 874bbac9 |
hex | 5670f4f2 |
1450243314 has 96 divisors (see below), whose sum is σ = 3447413424. Its totient is φ = 437944320.
The previous prime is 1450243303. The next prime is 1450243321. The reversal of 1450243314 is 4133420541.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 45118089 + 1405125225 = 6717^2 + 37485^2 .
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 4108162 + ... + 4108514.
Almost surely, 21450243314 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1450243314, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1723706712).
1450243314 is an abundant number, since it is smaller than the sum of its proper divisors (1997170110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1450243314 is a wasteful number, since it uses less digits than its factorization.
1450243314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652 (or 649 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 1450243314 is about 38082.0602646443. The cubic root of 1450243314 is about 1131.9145016731.
Adding to 1450243314 its reverse (4133420541), we get a palindrome (5583663855).
The spelling of 1450243314 in words is "one billion, four hundred fifty million, two hundred forty-three thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •