Base | Representation |
---|---|
bin | 1101010100100110010… |
… | …00010010000000000000 |
3 | 1121202111100001222010210 |
4 | 12222103020102000000 |
5 | 24444420122030013 |
6 | 550140332354120 |
7 | 45033045631002 |
oct | 6522310220000 |
9 | 1552440058123 |
10 | 457734955008 |
11 | 1671404a3651 |
12 | 74866615940 |
13 | 34219a41806 |
14 | 18223cc6372 |
15 | bd90381cc3 |
hex | 6a93212000 |
457734955008 has 112 divisors (see below), whose sum is σ = 1235262996576. Its totient is φ = 150739353600.
The previous prime is 457734954983. The next prime is 457734955019. The reversal of 457734955008 is 800559437754.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1927608 + ... + 2152008.
It is an arithmetic number, because the mean of its divisors is an integer number (11029133898).
Almost surely, 2457734955008 is an apocalyptic number.
457734955008 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 457734955008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (617631498288).
457734955008 is an abundant number, since it is smaller than the sum of its proper divisors (777528041568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
457734955008 is an equidigital number, since it uses as much as digits as its factorization.
457734955008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224513 (or 224489 counting only the distinct ones).
The product of its (nonzero) digits is 21168000, while the sum is 57.
The spelling of 457734955008 in words is "four hundred fifty-seven billion, seven hundred thirty-four million, nine hundred fifty-five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •