Base | Representation |
---|---|
bin | 111001111000001… |
… | …1110101100000000 |
3 | 12000100101022111210 |
4 | 1303300132230000 |
5 | 12434133312243 |
6 | 520413410120 |
7 | 66061323306 |
oct | 16360365400 |
9 | 5010338453 |
10 | 1942088448 |
11 | 907292883 |
12 | 462499940 |
13 | 24c47bb81 |
14 | 145d02276 |
15 | b5773933 |
hex | 73c1eb00 |
1942088448 has 72 divisors (see below), whose sum is σ = 5231233728. Its totient is φ = 639542272.
The previous prime is 1942088437. The next prime is 1942088453. The reversal of 1942088448 is 8448802491.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 1942088397 and 1942088406.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48511 + ... + 78977.
It is an arithmetic number, because the mean of its divisors is an integer number (72656024).
Almost surely, 21942088448 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1942088448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2615616864).
1942088448 is an abundant number, since it is smaller than the sum of its proper divisors (3289145280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1942088448 is an equidigital number, since it uses as much as digits as its factorization.
1942088448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30569 (or 30555 counting only the distinct ones).
The product of its (nonzero) digits is 589824, while the sum is 48.
The square root of 1942088448 is about 44069.1325986795. The cubic root of 1942088448 is about 1247.6410867964.
The spelling of 1942088448 in words is "one billion, nine hundred forty-two million, eighty-eight thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •