Base | Representation |
---|---|
bin | 1101000100110110110… |
… | …10100110000100110011 |
3 | 1120221200101011221201020 |
4 | 12202123122212010303 |
5 | 24330113203221323 |
6 | 542222004110523 |
7 | 44313451214544 |
oct | 6423332460463 |
9 | 1527611157636 |
10 | 449284038963 |
11 | 1635a4144311 |
12 | 730a8395443 |
13 | 334a0c70a86 |
14 | 17a617a24cb |
15 | ba484b6ae3 |
hex | 689b6a6133 |
449284038963 has 16 divisors (see below), whose sum is σ = 601509478176. Its totient is φ = 298293166080.
The previous prime is 449284038919. The next prime is 449284039007. The reversal of 449284038963 is 369830482944.
It is an interprime number because it is at equal distance from previous prime (449284038919) and next prime (449284039007).
It is not a de Polignac number, because 449284038963 - 26 = 449284038899 is a prime.
It is a super-2 number, since 2×4492840389632 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 449284038897 and 449284038906.
It is not an unprimeable number, because it can be changed into a prime (449284038163) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 399795 + ... + 1028787.
It is an arithmetic number, because the mean of its divisors is an integer number (37594342386).
Almost surely, 2449284038963 is an apocalyptic number.
449284038963 is a deficient number, since it is larger than the sum of its proper divisors (152225439213).
449284038963 is a wasteful number, since it uses less digits than its factorization.
449284038963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629974.
The product of its (nonzero) digits is 35831808, while the sum is 60.
The spelling of 449284038963 in words is "four hundred forty-nine billion, two hundred eighty-four million, thirty-eight thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •