Base | Representation |
---|---|
bin | 100101010011001111… |
… | …111110001000100101 |
3 | 10211101020202222202121 |
4 | 211103033332020211 |
5 | 1124011124320003 |
6 | 30222132305541 |
7 | 2615340202453 |
oct | 452317761045 |
9 | 124336688677 |
10 | 40051401253 |
11 | 15a92a76616 |
12 | 79191722b1 |
13 | 3a1390b6c6 |
14 | 1d1d34b9d3 |
15 | 109628bcbd |
hex | 9533fe225 |
40051401253 has 8 divisors (see below), whose sum is σ = 42753165120. Its totient is φ = 37409016960.
The previous prime is 40051401251. The next prime is 40051401259. The reversal of 40051401253 is 35210415004.
It is a happy number.
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 40051401253 - 21 = 40051401251 is a prime.
It is a super-2 number, since 2×400514012532 (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 (40051401251) 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 7 ways as a sum of consecutive naturals, for example, 14843500 + ... + 14846197.
It is an arithmetic number, because the mean of its divisors is an integer number (5344145640).
Almost surely, 240051401253 is an apocalyptic number.
It is an amenable number.
40051401253 is a deficient number, since it is larger than the sum of its proper divisors (2701763867).
40051401253 is a wasteful number, since it uses less digits than its factorization.
40051401253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29689787.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 40051401253 its reverse (35210415004), we get a palindrome (75261816257).
The spelling of 40051401253 in words is "forty billion, fifty-one million, four hundred one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •