Base | Representation |
---|---|
bin | 1101000110101100100… |
… | …11010000011101001101 |
3 | 1121001020020011002220012 |
4 | 12203112103100131031 |
5 | 24334124111034044 |
6 | 542504015003005 |
7 | 44350105414400 |
oct | 6432623203515 |
9 | 1531206132805 |
10 | 450271971149 |
11 | 163a608753a0 |
12 | 73323209465 |
13 | 335ca844130 |
14 | 17b16a8bd37 |
15 | baa50b259e |
hex | 68d64d074d |
450271971149 has 48 divisors (see below), whose sum is σ = 615753653760. Its totient is φ = 323663034240.
The previous prime is 450271971137. The next prime is 450271971151. The reversal of 450271971149 is 941179172054.
It is not a de Polignac number, because 450271971149 - 28 = 450271970893 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 450271971097 and 450271971106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450271971049) 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 47 ways as a sum of consecutive naturals, for example, 11282372 + ... + 11322210.
It is an arithmetic number, because the mean of its divisors is an integer number (12828201120).
Almost surely, 2450271971149 is an apocalyptic number.
450271971149 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
It is an amenable number.
450271971149 is a deficient number, since it is larger than the sum of its proper divisors (165481682611).
450271971149 is a wasteful number, since it uses less digits than its factorization.
450271971149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41490 (or 41483 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 50.
The spelling of 450271971149 in words is "four hundred fifty billion, two hundred seventy-one million, nine hundred seventy-one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •