Base | Representation |
---|---|
bin | 100110000110001000… |
… | …011011011011111001 |
3 | 10220120202002110100101 |
4 | 212012020123123321 |
5 | 1132233143442022 |
6 | 30442545235401 |
7 | 2645444201632 |
oct | 460610333371 |
9 | 126522073311 |
10 | 40905062137 |
11 | 16390928685 |
12 | 7b17032b61 |
13 | 3b1b72c0a4 |
14 | 1da0884889 |
15 | 10e61b3627 |
hex | 98621b6f9 |
40905062137 has 8 divisors (see below), whose sum is σ = 41880629376. Its totient is φ = 39933880272.
The previous prime is 40905062117. The next prime is 40905062153. The reversal of 40905062137 is 73126050904.
40905062137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40905062137 - 211 = 40905060089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40905062096 and 40905062105.
It is not an unprimeable number, because it can be changed into a prime (40905062117) 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, 1077463 + ... + 1114780.
It is an arithmetic number, because the mean of its divisors is an integer number (5235078672).
Almost surely, 240905062137 is an apocalyptic number.
40905062137 is a gapful number since it is divisible by the number (47) formed by its first and last digit.
It is an amenable number.
40905062137 is a deficient number, since it is larger than the sum of its proper divisors (975567239).
40905062137 is a wasteful number, since it uses less digits than its factorization.
40905062137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2192687.
The product of its (nonzero) digits is 45360, while the sum is 37.
The spelling of 40905062137 in words is "forty billion, nine hundred five million, sixty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •