Base | Representation |
---|---|
bin | 100101011001001111… |
… | …101110100100001101 |
3 | 10211122021001222101001 |
4 | 211121033232210031 |
5 | 1124212403011111 |
6 | 30240124420301 |
7 | 2621001242524 |
oct | 453117564415 |
9 | 124567058331 |
10 | 40152000781 |
11 | 16034837522 |
12 | 79469a7691 |
13 | 3a2b702059 |
14 | 1d2c8574bb |
15 | 10a000e1c1 |
hex | 9593ee90d |
40152000781 has 16 divisors (see below), whose sum is σ = 42978945600. Its totient is φ = 37397030400.
The previous prime is 40152000773. The next prime is 40152000797. The reversal of 40152000781 is 18700025104.
It is a cyclic number.
It is not a de Polignac number, because 40152000781 - 23 = 40152000773 is a prime.
It is a super-2 number, since 2×401520007812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40152000281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2787165 + ... + 2801533.
It is an arithmetic number, because the mean of its divisors is an integer number (2686184100).
Almost surely, 240152000781 is an apocalyptic number.
40152000781 is the 89613-rd centered decagonal number.
It is an amenable number.
40152000781 is a deficient number, since it is larger than the sum of its proper divisors (2826944819).
40152000781 is a wasteful number, since it uses less digits than its factorization.
40152000781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16860.
The product of its (nonzero) digits is 2240, while the sum is 28.
Adding to 40152000781 its reverse (18700025104), we get a palindrome (58852025885).
The spelling of 40152000781 in words is "forty billion, one hundred fifty-two million, seven hundred eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •