Base | Representation |
---|---|
bin | 100101100101110011… |
… | …001011110001100010 |
3 | 10212011221101122102210 |
4 | 211211303023301202 |
5 | 1130130312401200 |
6 | 30313051022550 |
7 | 2626136424642 |
oct | 454563136142 |
9 | 125157348383 |
10 | 40362622050 |
11 | 16132714393 |
12 | 79a543aa56 |
13 | 3a6323791a |
14 | 1d4c802522 |
15 | 10b3765650 |
hex | 965ccbc62 |
40362622050 has 24 divisors (see below), whose sum is σ = 100099303056. Its totient is φ = 10763365840.
The previous prime is 40362622039. The next prime is 40362622057. The reversal of 40362622050 is 5022626304.
40362622050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×403626220502 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 40362621999 and 40362622017.
It is not an unprimeable number, because it can be changed into a prime (40362622057) 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, 134541924 + ... + 134542223.
It is an arithmetic number, because the mean of its divisors is an integer number (4170804294).
Almost surely, 240362622050 is an apocalyptic number.
40362622050 is an abundant number, since it is smaller than the sum of its proper divisors (59736681006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40362622050 is a wasteful number, since it uses less digits than its factorization.
40362622050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 269084162 (or 269084157 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
The spelling of 40362622050 in words is "forty billion, three hundred sixty-two million, six hundred twenty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •