Base | Representation |
---|---|
bin | 10010101001100111000011… |
… | …01000001010000111101110 |
3 | 12101012201111001222222001000 |
4 | 21110303201220022013232 |
5 | 20333420322041034042 |
6 | 223120414110101130 |
7 | 11432012614600416 |
oct | 1124634150120756 |
9 | 171181431888030 |
10 | 41012133143022 |
11 | 12082169a7a998 |
12 | 47245144aa7a6 |
13 | 19b6573474072 |
14 | a1add80bb646 |
15 | 4b1c4675374c |
hex | 254ce1a0a1ee |
41012133143022 has 16 divisors (see below), whose sum is σ = 91138073651280. Its totient is φ = 13670711047656.
The previous prime is 41012133143021. The next prime is 41012133143071. The reversal of 41012133143022 is 22034133121014.
41012133143022 is a `hidden beast` number, since 4 + 1 + 0 + 1 + 21 + 331 + 4 + 302 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41012133143021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 379741973493 + ... + 379741973600.
It is an arithmetic number, because the mean of its divisors is an integer number (5696129603205).
Almost surely, 241012133143022 is an apocalyptic number.
41012133143022 is an abundant number, since it is smaller than the sum of its proper divisors (50125940508258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41012133143022 is a wasteful number, since it uses less digits than its factorization.
41012133143022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 759483947104 (or 759483947098 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 41012133143022 its reverse (22034133121014), we get a palindrome (63046266264036).
The spelling of 41012133143022 in words is "forty-one trillion, twelve billion, one hundred thirty-three million, one hundred forty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •