Base | Representation |
---|---|
bin | 100011011011001010000… |
… | …101111000111010101110 |
3 | 22121201110111000011010210 |
4 | 203123022011320322232 |
5 | 304341013024443042 |
6 | 5102153222043250 |
7 | 340606156565346 |
oct | 43331205707256 |
9 | 8551414004123 |
10 | 2434342031022 |
11 | 859442682400 |
12 | 333960279526 |
13 | 1487329b2115 |
14 | 85b73a05d26 |
15 | 434c97d7a9c |
hex | 236ca178eae |
2434342031022 has 48 divisors (see below), whose sum is σ = 5363945991936. Its totient is φ = 735967755600.
The previous prime is 2434342030973. The next prime is 2434342031027. The reversal of 2434342031022 is 2201302434342.
It is a super-2 number, since 2×24343420310222 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2434342031027) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3576988 + ... + 4202799.
It is an arithmetic number, because the mean of its divisors is an integer number (111748874832).
Almost surely, 22434342031022 is an apocalyptic number.
2434342031022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2434342031022 is an abundant number, since it is smaller than the sum of its proper divisors (2929603960914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2434342031022 is a wasteful number, since it uses less digits than its factorization.
2434342031022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7780245 (or 7780234 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 2434342031022 its reverse (2201302434342), we get a palindrome (4635644465364).
The spelling of 2434342031022 in words is "two trillion, four hundred thirty-four billion, three hundred forty-two million, thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •