Base | Representation |
---|---|
bin | 10011001100111000010111… |
… | …01101101110101011000000 |
3 | 12112111120120112222012020111 |
4 | 21212130023231232223000 |
5 | 21013244243111232000 |
6 | 225445240315521104 |
7 | 11615404402245223 |
oct | 1146341355565300 |
9 | 175446515865214 |
10 | 42224020024000 |
11 | 124aa119586661 |
12 | 489b36aa59194 |
13 | 1a73928638649 |
14 | a5d9211b95ba |
15 | 4d3524cb7cba |
hex | 26670bb6eac0 |
42224020024000 has 56 divisors (see below), whose sum is σ = 104567785609248. Its totient is φ = 16889608006400.
The previous prime is 42224020023989. The next prime is 42224020024013. The reversal of 42224020024000 is 42002042224.
It is a happy number.
42224020024000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 7 ways as a sum of consecutive naturals, for example, 2638993252 + ... + 2639009251.
Almost surely, 242224020024000 is an apocalyptic number.
42224020024000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42224020024000 is an abundant number, since it is smaller than the sum of its proper divisors (62343765585248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42224020024000 is an equidigital number, since it uses as much as digits as its factorization.
42224020024000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5278002530 (or 5278002510 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 22.
Adding to 42224020024000 its reverse (42002042224), we get a palindrome (42266022066224).
The spelling of 42224020024000 in words is "forty-two trillion, two hundred twenty-four billion, twenty million, twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •