Base | Representation |
---|---|
bin | 10010001111111111111000… |
… | …01110100100011011111110 |
3 | 12021002120222211022110221022 |
4 | 21013333330032210123332 |
5 | 20230011030421433342 |
6 | 221204234244104142 |
7 | 11311310061056135 |
oct | 1107777416443376 |
9 | 167076884273838 |
10 | 40132111124222 |
11 | 11872a29540067 |
12 | 4601a56995052 |
13 | 1951598953610 |
14 | 9ca5940c891c |
15 | 498ddd0939d2 |
hex | 247ffc3a46fe |
40132111124222 has 32 divisors (see below), whose sum is σ = 66627195667200. Its totient is φ = 18009379842048.
The previous prime is 40132111124219. The next prime is 40132111124239. The reversal of 40132111124222 is 22242111123104.
It is a super-2 number, since 2×401321111242222 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 40132111124191 and 40132111124200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13110947 + ... + 15879582.
It is an arithmetic number, because the mean of its divisors is an integer number (2082099864600).
Almost surely, 240132111124222 is an apocalyptic number.
40132111124222 is a deficient number, since it is larger than the sum of its proper divisors (26495084542978).
40132111124222 is a wasteful number, since it uses less digits than its factorization.
40132111124222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28992020.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 40132111124222 its reverse (22242111123104), we get a palindrome (62374222247326).
The spelling of 40132111124222 in words is "forty trillion, one hundred thirty-two billion, one hundred eleven million, one hundred twenty-four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •