Base | Representation |
---|---|
bin | 10010011010110101011100… |
… | …00101010111110010100111 |
3 | 12022102012002121122020222111 |
4 | 21031122232011113302213 |
5 | 20302111114313320111 |
6 | 222051254300541451 |
7 | 11350231222266001 |
oct | 1115325605276247 |
9 | 168365077566874 |
10 | 40504462245031 |
11 | 119a6933a96284 |
12 | 4662052551887 |
13 | 197a7290302c5 |
14 | a005d81bb371 |
15 | 4a3932481a21 |
hex | 24d6ae157ca7 |
40504462245031 has 4 divisors (see below), whose sum is σ = 40505066198352. Its totient is φ = 40503858291712.
The previous prime is 40504462245029. The next prime is 40504462245097. The reversal of 40504462245031 is 13054226440504.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40504462245031 - 21 = 40504462245029 is a prime.
It is a super-2 number, since 2×405044622450312 (a number of 28 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 (40504460245031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 301876051 + ... + 302010196.
It is an arithmetic number, because the mean of its divisors is an integer number (10126266549588).
Almost surely, 240504462245031 is an apocalyptic number.
40504462245031 is a deficient number, since it is larger than the sum of its proper divisors (603953321).
40504462245031 is an equidigital number, since it uses as much as digits as its factorization.
40504462245031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603953320.
The product of its (nonzero) digits is 460800, while the sum is 40.
Adding to 40504462245031 its reverse (13054226440504), we get a palindrome (53558688685535).
The spelling of 40504462245031 in words is "forty trillion, five hundred four billion, four hundred sixty-two million, two hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •