Base | Representation |
---|---|
bin | 111010100011110110010… |
… | …010000100001110110000 |
3 | 112020201012220101020202020 |
4 | 322203312102010032300 |
5 | 1011413101124220422 |
6 | 12320411324551440 |
7 | 563511645555540 |
oct | 72436622041660 |
9 | 15221186336666 |
10 | 4024221320112 |
11 | 13117320299a4 |
12 | 54bb076b2580 |
13 | 232636c05306 |
14 | dcab810b320 |
15 | 6ea2c61795c |
hex | 3a8f64843b0 |
4024221320112 has 80 divisors (see below), whose sum is σ = 11996384325120. Its totient is φ = 1138614621696.
The previous prime is 4024221320087. The next prime is 4024221320131. The reversal of 4024221320112 is 2110231224204.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58105437 + ... + 58174652.
It is an arithmetic number, because the mean of its divisors is an integer number (149954804064).
Almost surely, 24024221320112 is an apocalyptic number.
4024221320112 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
4024221320112 is an abundant number, since it is smaller than the sum of its proper divisors (7972163005008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4024221320112 is a wasteful number, since it uses less digits than its factorization.
4024221320112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116280210 (or 116280204 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 4024221320112 its reverse (2110231224204), we get a palindrome (6134452544316).
The spelling of 4024221320112 in words is "four trillion, twenty-four billion, two hundred twenty-one million, three hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •