Base | Representation |
---|---|
bin | 1101000111110011001… |
… | …11100010011101101110 |
3 | 1121002202112002012102210 |
4 | 12203321213202131232 |
5 | 24341332302142400 |
6 | 543042502431250 |
7 | 44400561635541 |
oct | 6437147423556 |
9 | 1532675065383 |
10 | 450864490350 |
11 | 16423528388a |
12 | 73469732526 |
13 | 33693520a01 |
14 | 17b71648858 |
15 | badc103950 |
hex | 68f99e276e |
450864490350 has 96 divisors (see below), whose sum is σ = 1133540529120. Its totient is φ = 118581760000.
The previous prime is 450864490343. The next prime is 450864490409. The reversal of 450864490350 is 53094468054.
It is a self number, because there is not a number n which added to its sum of digits gives 450864490350.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5311240 + ... + 5395460.
It is an arithmetic number, because the mean of its divisors is an integer number (11807713845).
Almost surely, 2450864490350 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 450864490350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (566770264560).
450864490350 is an abundant number, since it is smaller than the sum of its proper divisors (682676038770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
450864490350 is a wasteful number, since it uses less digits than its factorization.
450864490350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84726 (or 84721 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 48.
The spelling of 450864490350 in words is "four hundred fifty billion, eight hundred sixty-four million, four hundred ninety thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •