Base | Representation |
---|---|
bin | 100101101101111111… |
… | …010000110010111011 |
3 | 10212112111220110220000 |
4 | 211231333100302323 |
5 | 1130421000143300 |
6 | 30334435404043 |
7 | 2632425241314 |
oct | 455577206273 |
9 | 125474813800 |
10 | 40500006075 |
11 | 161a321a001 |
12 | 7a23453623 |
13 | 3a8583a349 |
14 | 1d62b6560b |
15 | 10c0851c00 |
hex | 96dfd0cbb |
40500006075 has 30 divisors (see below), whose sum is σ = 75020015004. Its totient is φ = 21600002160.
The previous prime is 40500006061. The next prime is 40500006077. The reversal of 40500006075 is 57060000504.
40500006075 is a `hidden beast` number, since 4 + 0 + 50 + 0 + 0 + 0 + 607 + 5 = 666.
It is not a de Polignac number, because 40500006075 - 29 = 40500005563 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
40500006075 is a modest number, since divided by 6075 gives 4050 as remainder.
It is not an unprimeable number, because it can be changed into a prime (40500006077) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 9997977 + ... + 10002026.
Almost surely, 240500006075 is an apocalyptic number.
40500006075 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
40500006075 is a deficient number, since it is larger than the sum of its proper divisors (34520008929).
40500006075 is a wasteful number, since it uses less digits than its factorization.
40500006075 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20000025 (or 20000011 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
Adding to 40500006075 its reverse (57060000504), we get a palindrome (97560006579).
The spelling of 40500006075 in words is "forty billion, five hundred million, six thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •