Base | Representation |
---|---|
bin | 1001011111110100011011… |
… | …0110100010111010000010 |
3 | 1100222021021122112102000020 |
4 | 2113331012312202322002 |
5 | 2332041214033403300 |
6 | 34113034431234310 |
7 | 2125266536126142 |
oct | 227750666427202 |
9 | 40867248472006 |
10 | 10442254200450 |
11 | 33665982a3636 |
12 | 1207941978996 |
13 | 5a9914876a27 |
14 | 28159d008922 |
15 | 1319611998a0 |
hex | 97f46da2e82 |
10442254200450 has 96 divisors (see below), whose sum is σ = 27055029706560. Its totient is φ = 2661960672000.
The previous prime is 10442254200449. The next prime is 10442254200457. The reversal of 10442254200450 is 5400245224401.
It is not an unprimeable number, because it can be changed into a prime (10442254200457) by changing a digit.
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, 11444404 + ... + 12323103.
It is an arithmetic number, because the mean of its divisors is an integer number (281823226110).
Almost surely, 210442254200450 is an apocalyptic number.
10442254200450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10442254200450 is an abundant number, since it is smaller than the sum of its proper divisors (16612775506110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10442254200450 is a wasteful number, since it uses less digits than its factorization.
10442254200450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23767652 (or 23767647 counting only the distinct ones).
The product of its (nonzero) digits is 51200, while the sum is 33.
Adding to 10442254200450 its reverse (5400245224401), we get a palindrome (15842499424851).
The spelling of 10442254200450 in words is "ten trillion, four hundred forty-two billion, two hundred fifty-four million, two hundred thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •