Base | Representation |
---|---|
bin | 100010000101100100011… |
… | …000011111000010100000 |
3 | 22021221020202121010212202 |
4 | 202011210120133002200 |
5 | 301334304434112022 |
6 | 4552034102512332 |
7 | 331143610445153 |
oct | 42054430370240 |
9 | 8257222533782 |
10 | 2342441316512 |
11 | 823473068380 |
12 | 319b92a356a8 |
13 | 13cb78168ccb |
14 | 815364d5c9a |
15 | 40deb65b592 |
hex | 2216461f0a0 |
2342441316512 has 48 divisors (see below), whose sum is σ = 5079769111872. Its totient is φ = 1054408696320.
The previous prime is 2342441316511. The next prime is 2342441316521. The reversal of 2342441316512 is 2156131442432.
It is a super-2 number, since 2×23424413165122 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2342441316511) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32267933 + ... + 32340444.
It is an arithmetic number, because the mean of its divisors is an integer number (105828523164).
Almost surely, 22342441316512 is an apocalyptic number.
2342441316512 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2342441316512 is an abundant number, since it is smaller than the sum of its proper divisors (2737327795360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2342441316512 is a wasteful number, since it uses less digits than its factorization.
2342441316512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64608501 (or 64608493 counting only the distinct ones).
The product of its digits is 138240, while the sum is 38.
Adding to 2342441316512 its reverse (2156131442432), we get a palindrome (4498572758944).
The spelling of 2342441316512 in words is "two trillion, three hundred forty-two billion, four hundred forty-one million, three hundred sixteen thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •