Base | Representation |
---|---|
bin | 1010000001011101010010… |
… | …00111001100101011110001 |
3 | 2220001000220102000201001212 |
4 | 11000232221013030223301 |
5 | 10342102030443312431 |
6 | 114513103005205505 |
7 | 4433234352366560 |
oct | 500565107145361 |
9 | 86030812021055 |
10 | 22040314432241 |
11 | 70282769a8516 |
12 | 257b688860895 |
13 | c3b514aac531 |
14 | 562a84d67bd7 |
15 | 2834bc25a72b |
hex | 140ba91ccaf1 |
22040314432241 has 12 divisors (see below), whose sum is σ = 26027688108096. Its totient is φ = 18282288463560.
The previous prime is 22040314432231. The next prime is 22040314432271. The reversal of 22040314432241 is 14223441304022.
It is a happy number.
It is not a de Polignac number, because 22040314432241 - 26 = 22040314432177 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22040314432198 and 22040314432207.
It is not an unprimeable number, because it can be changed into a prime (22040314432231) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1638191165 + ... + 1638204618.
It is an arithmetic number, because the mean of its divisors is an integer number (2168974009008).
Almost surely, 222040314432241 is an apocalyptic number.
It is an amenable number.
22040314432241 is a deficient number, since it is larger than the sum of its proper divisors (3987373675855).
22040314432241 is an equidigital number, since it uses as much as digits as its factorization.
22040314432241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3276395852 (or 3276395821 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 22040314432241 its reverse (14223441304022), we get a palindrome (36263755736263).
The spelling of 22040314432241 in words is "twenty-two trillion, forty billion, three hundred fourteen million, four hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •