Base | Representation |
---|---|
bin | 111010101001010000000… |
… | …010110000000100110100 |
3 | 112021021012011210121100012 |
4 | 322221100002300010310 |
5 | 1012011441142102012 |
6 | 12323211110235352 |
7 | 564105464454404 |
oct | 72512002600464 |
9 | 15237164717305 |
10 | 4030022222132 |
11 | 13141395334a5 |
12 | 551066355b58 |
13 | 23304c97150a |
14 | dd0a86d0804 |
15 | 6ec6ba23622 |
hex | 3aa500b0134 |
4030022222132 has 24 divisors (see below), whose sum is σ = 7447835739456. Its totient is φ = 1904180218688.
The previous prime is 4030022222029. The next prime is 4030022222137. The reversal of 4030022222132 is 2312222200304.
It is a super-2 number, since 2×40300222221322 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 4030022222098 and 4030022222107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4030022222137) 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, 263875433 + ... + 263890704.
It is an arithmetic number, because the mean of its divisors is an integer number (310326489144).
Almost surely, 24030022222132 is an apocalyptic number.
It is an amenable number.
4030022222132 is a deficient number, since it is larger than the sum of its proper divisors (3417813517324).
4030022222132 is a wasteful number, since it uses less digits than its factorization.
4030022222132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527766247 (or 527766245 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 4030022222132 its reverse (2312222200304), we get a palindrome (6342244422436).
The spelling of 4030022222132 in words is "four trillion, thirty billion, twenty-two million, two hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •