Base | Representation |
---|---|
bin | 10010010010100110000011… |
… | …01000010100100100001110 |
3 | 12021102010021002221102010211 |
4 | 21021103001220110210032 |
5 | 20232441232004114210 |
6 | 221313230445553034 |
7 | 11320615601610151 |
oct | 1111230150244416 |
9 | 167363232842124 |
10 | 40221322332430 |
11 | 118a7848986208 |
12 | 46171b357577a |
13 | 1959b15218495 |
14 | 9d0a18337c98 |
15 | 49b3b005e38a |
hex | 2494c1a1490e |
40221322332430 has 8 divisors (see below), whose sum is σ = 72398380198392. Its totient is φ = 16088528932968.
The previous prime is 40221322332421. The next prime is 40221322332431. The reversal of 40221322332430 is 3423322312204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 40221322332392 and 40221322332401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40221322332431) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2011066116612 + ... + 2011066116631.
It is an arithmetic number, because the mean of its divisors is an integer number (9049797524799).
Almost surely, 240221322332430 is an apocalyptic number.
40221322332430 is a deficient number, since it is larger than the sum of its proper divisors (32177057865962).
40221322332430 is a wasteful number, since it uses less digits than its factorization.
40221322332430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4022132233250.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 40221322332430 its reverse (3423322312204), we get a palindrome (43644644644634).
The spelling of 40221322332430 in words is "forty trillion, two hundred twenty-one billion, three hundred twenty-two million, three hundred thirty-two thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •