Base | Representation |
---|---|
bin | 100101110110100111… |
… | …011011111110010011 |
3 | 10212220121021111120011 |
4 | 211312213123332103 |
5 | 1131220024132342 |
6 | 30401050055351 |
7 | 2636133502000 |
oct | 456647337623 |
9 | 125817244504 |
10 | 40644755347 |
11 | 162679a52a9 |
12 | 7a63a1a557 |
13 | 3aa981b2c1 |
14 | 1d780848a7 |
15 | 10cd3e5717 |
hex | 9769dbf93 |
40644755347 has 8 divisors (see below), whose sum is σ = 47399132000. Its totient is φ = 34838361432.
The previous prime is 40644755299. The next prime is 40644755387. The reversal of 40644755347 is 74355744604.
It is not a de Polignac number, because 40644755347 - 211 = 40644753299 is a prime.
It is a super-2 number, since 2×406447553472 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
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 40644755347.
It is not an unprimeable number, because it can be changed into a prime (40644755387) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59248572 + ... + 59249257.
It is an arithmetic number, because the mean of its divisors is an integer number (5924891500).
Almost surely, 240644755347 is an apocalyptic number.
40644755347 is a deficient number, since it is larger than the sum of its proper divisors (6754376653).
40644755347 is an equidigital number, since it uses as much as digits as its factorization.
40644755347 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118497850 (or 118497836 counting only the distinct ones).
The product of its (nonzero) digits is 5644800, while the sum is 49.
The spelling of 40644755347 in words is "forty billion, six hundred forty-four million, seven hundred fifty-five thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •