Base | Representation |
---|---|
bin | 100110100011101101… |
… | …000011010101100110 |
3 | 10221212022122222022200 |
4 | 212203231003111212 |
5 | 1134242201431042 |
6 | 31004111235330 |
7 | 2663650260615 |
oct | 464355032546 |
9 | 127768588280 |
10 | 41401202022 |
11 | 16615998944 |
12 | 8035218b46 |
13 | 3b9a46219b |
14 | 200a71387c |
15 | 1124a17c4c |
hex | 9a3b43566 |
41401202022 has 24 divisors (see below), whose sum is σ = 92127000576. Its totient is φ = 13427416656.
The previous prime is 41401201999. The next prime is 41401202041. The reversal of 41401202022 is 22020210414.
41401202022 is a `hidden beast` number, since 41 + 401 + 20 + 202 + 2 = 666.
41401202022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 41401201986 and 41401202004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31081318 + ... + 31082649.
It is an arithmetic number, because the mean of its divisors is an integer number (3838625024).
Almost surely, 241401202022 is an apocalyptic number.
41401202022 is an abundant number, since it is smaller than the sum of its proper divisors (50725798554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41401202022 is a wasteful number, since it uses less digits than its factorization.
41401202022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62164012 (or 62164009 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 41401202022 its reverse (22020210414), we get a palindrome (63421412436).
The spelling of 41401202022 in words is "forty-one billion, four hundred one million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •