Base | Representation |
---|---|
bin | 100101011101101010… |
… | …001110101110001101 |
3 | 10211211102102102112201 |
4 | 211131222032232031 |
5 | 1124340332311401 |
6 | 30251332001501 |
7 | 2622560562256 |
oct | 453552165615 |
9 | 124742372481 |
10 | 40226057101 |
11 | 1607261909a |
12 | 7967760291 |
13 | 3a40b60c69 |
14 | 1d38613b2d |
15 | 10a678bb01 |
hex | 95da8eb8d |
40226057101 has 8 divisors (see below), whose sum is σ = 42739679160. Its totient is φ = 37859813824.
The previous prime is 40226056961. The next prime is 40226057189. The reversal of 40226057101 is 10175062204.
It can be written as a sum of positive squares in 4 ways, for example, as 10378311876 + 29847745225 = 101874^2 + 172765^2 .
It is not a de Polignac number, because 40226057101 - 213 = 40226048909 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40226057101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40226057701) 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, 4088926 + ... + 4098751.
It is an arithmetic number, because the mean of its divisors is an integer number (5342459895).
Almost surely, 240226057101 is an apocalyptic number.
It is an amenable number.
40226057101 is a deficient number, since it is larger than the sum of its proper divisors (2513622059).
40226057101 is an frugal number, since it uses more digits than its factorization.
40226057101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8187728 (or 8187694 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 28.
It can be divided in two parts, 402260 and 57101, that added together give a triangular number (459361 = T958).
The spelling of 40226057101 in words is "forty billion, two hundred twenty-six million, fifty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •