Base | Representation |
---|---|
bin | 101011001100000… |
… | …0100011111110111 |
3 | 10201222211110201002 |
4 | 1112120010133313 |
5 | 10431440303310 |
6 | 355444153515 |
7 | 50624401304 |
oct | 12630043767 |
9 | 3658743632 |
10 | 1449150455 |
11 | 68400a205 |
12 | 34539889b |
13 | 1a12ca29c |
14 | da6680ab |
15 | 87352da5 |
hex | 566047f7 |
1449150455 has 8 divisors (see below), whose sum is σ = 1739620800. Its totient is φ = 1158893536.
The previous prime is 1449150419. The next prime is 1449150457. The reversal of 1449150455 is 5540519441.
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 1449150455 - 216 = 1449084919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1449150457) 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, 38015 + ... + 65904.
It is an arithmetic number, because the mean of its divisors is an integer number (217452600).
Almost surely, 21449150455 is an apocalyptic number.
1449150455 is a deficient number, since it is larger than the sum of its proper divisors (290470345).
1449150455 is a wasteful number, since it uses less digits than its factorization.
1449150455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106713.
The product of its (nonzero) digits is 72000, while the sum is 38.
The square root of 1449150455 is about 38067.7088225703. The cubic root of 1449150455 is about 1131.6301048421.
Adding to 1449150455 its reverse (5540519441), we get a palindrome (6989669896).
It can be divided in two parts, 14491 and 50455, that added together give a palindrome (64946).
The spelling of 1449150455 in words is "one billion, four hundred forty-nine million, one hundred fifty thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •