Base | Representation |
---|---|
bin | 100101011101100000… |
… | …001101100111010010 |
3 | 10211211020111000101020 |
4 | 211131200031213102 |
5 | 1124334144243442 |
6 | 30251155420310 |
7 | 2622526344330 |
oct | 453540154722 |
9 | 124736430336 |
10 | 40223431122 |
11 | 16071095166 |
12 | 79668b4696 |
13 | 3a40451924 |
14 | 1d3812cb50 |
15 | 10a641d9ec |
hex | 95d80d9d2 |
40223431122 has 32 divisors (see below), whose sum is σ = 92043713664. Its totient is φ = 11479353600.
The previous prime is 40223431117. The next prime is 40223431151. The reversal of 40223431122 is 22113432204.
It is a happy number.
It is a super-2 number, since 2×402234311222 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40223431092 and 40223431101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 506529 + ... + 580532.
It is an arithmetic number, because the mean of its divisors is an integer number (2876366052).
Almost surely, 240223431122 is an apocalyptic number.
40223431122 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
40223431122 is an abundant number, since it is smaller than the sum of its proper divisors (51820282542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40223431122 is a wasteful number, since it uses less digits than its factorization.
40223431122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1087954.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 40223431122 its reverse (22113432204), we get a palindrome (62336863326).
The spelling of 40223431122 in words is "forty billion, two hundred twenty-three million, four hundred thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.709 sec. • engine limits •