Base | Representation |
---|---|
bin | 10010101001110101110000… |
… | …11100101101100111101010 |
3 | 12101020110212120111012211100 |
4 | 21110322320130231213222 |
5 | 20334033011221231214 |
6 | 223124202002342230 |
7 | 11432412431555403 |
oct | 1124727034554752 |
9 | 171213776435740 |
10 | 41020032211434 |
11 | 1208555287aa01 |
12 | 4725b5995a976 |
13 | 19b7231b08643 |
14 | a1b5471d09aa |
15 | 4b2059e63309 |
hex | 254eb872d9ea |
41020032211434 has 48 divisors (see below), whose sum is σ = 89584011316800. Its totient is φ = 13564681728768.
The previous prime is 41020032211427. The next prime is 41020032211439. The reversal of 41020032211434 is 43411223002014.
41020032211434 is a `hidden beast` number, since 4 + 1 + 0 + 2 + 0 + 0 + 3 + 221 + 1 + 434 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 41020032211398 and 41020032211407.
It is not an unprimeable number, because it can be changed into a prime (41020032211439) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2914759 + ... + 9515034.
It is an arithmetic number, because the mean of its divisors is an integer number (1866333569100).
Almost surely, 241020032211434 is an apocalyptic number.
41020032211434 is an abundant number, since it is smaller than the sum of its proper divisors (48563979105366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41020032211434 is a wasteful number, since it uses less digits than its factorization.
41020032211434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12431259 (or 12431256 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 41020032211434 its reverse (43411223002014), we get a palindrome (84431255213448).
The spelling of 41020032211434 in words is "forty-one trillion, twenty billion, thirty-two million, two hundred eleven thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •