Base | Representation |
---|---|
bin | 100011001110111000011… |
… | …011110110011001000000 |
3 | 22120110102212101010020011 |
4 | 203032320123312121000 |
5 | 304132014142133224 |
6 | 5052133240354304 |
7 | 336631424024431 |
oct | 43167033663100 |
9 | 8513385333204 |
10 | 2421160896064 |
11 | 85389922a639 |
12 | 3312a1a75994 |
13 | 147411c2ca91 |
14 | 852831a9488 |
15 | 42ea7506394 |
hex | 233b86f6640 |
2421160896064 has 63 divisors (see below), whose sum is σ = 4878950915307. Its totient is φ = 1192101297024.
The previous prime is 2421160896053. The next prime is 2421160896083. The reversal of 2421160896064 is 4606980611242.
The square root of 2421160896064 is 1556008.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2421160895999 and 2421160896017.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 834018837 + ... + 834021739.
Almost surely, 22421160896064 is an apocalyptic number.
2421160896064 is the 1556008-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2421160896064
2421160896064 is an abundant number, since it is smaller than the sum of its proper divisors (2457790019243).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2421160896064 is an frugal number, since it uses more digits than its factorization.
2421160896064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5952 (or 2972 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 49.
Multiplying 2421160896064 by its sum of digits (49), we get a square (118636883907136 = 108920562).
The spelling of 2421160896064 in words is "two trillion, four hundred twenty-one billion, one hundred sixty million, eight hundred ninety-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •