Base | Representation |
---|---|
bin | 10010011000101100101001… |
… | …00111100010100100011111 |
3 | 12022011011112100010121200112 |
4 | 21030112110213202210133 |
5 | 20244410212230103211 |
6 | 221553430542320235 |
7 | 11342021244215210 |
oct | 1114262447424437 |
9 | 168134470117615 |
10 | 40431020550431 |
11 | 11978777080105 |
12 | 464b976b8907b |
13 | 1973823851b94 |
14 | 9dac2c463407 |
15 | 4a1a84b2e88b |
hex | 24c5949e291f |
40431020550431 has 4 divisors (see below), whose sum is σ = 46206880629072. Its totient is φ = 34655160471792.
The previous prime is 40431020550419. The next prime is 40431020550451. The reversal of 40431020550431 is 13405502013404.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-40431020550431 is a prime.
It is a super-2 number, since 2×404310205504312 (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 (40431020550451) 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, 2887930039310 + ... + 2887930039323.
It is an arithmetic number, because the mean of its divisors is an integer number (11551720157268).
Almost surely, 240431020550431 is an apocalyptic number.
40431020550431 is a deficient number, since it is larger than the sum of its proper divisors (5775860078641).
40431020550431 is an equidigital number, since it uses as much as digits as its factorization.
40431020550431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5775860078640.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 40431020550431 its reverse (13405502013404), we get a palindrome (53836522563835).
The spelling of 40431020550431 in words is "forty trillion, four hundred thirty-one billion, twenty million, five hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •