Base | Representation |
---|---|
bin | 10011001001111010111101… |
… | …01010001111011011100111 |
3 | 12112010212002202202211210021 |
4 | 21210331132222033123213 |
5 | 21010113014043402211 |
6 | 225330422105140011 |
7 | 11605144443604150 |
oct | 1144753652173347 |
9 | 175125082684707 |
10 | 42122332403431 |
11 | 1246aa87573215 |
12 | 488370ba8a607 |
13 | 1a671712c5267 |
14 | a58a35d76927 |
15 | 4d0a72822771 |
hex | 264f5ea8f6e7 |
42122332403431 has 8 divisors (see below), whose sum is σ = 48143493768704. Its totient is φ = 36102092365080.
The previous prime is 42122332403399. The next prime is 42122332403453. The reversal of 42122332403431 is 13430423322124.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42122332403431 - 25 = 42122332403399 is a prime.
It is a super-2 number, since 2×421223324034312 (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 (42122332403491) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 230233755 + ... + 230416636.
It is an arithmetic number, because the mean of its divisors is an integer number (6017936721088).
Almost surely, 242122332403431 is an apocalyptic number.
42122332403431 is a deficient number, since it is larger than the sum of its proper divisors (6021161365273).
42122332403431 is a wasteful number, since it uses less digits than its factorization.
42122332403431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 460663461.
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 42122332403431 its reverse (13430423322124), we get a palindrome (55552755725555).
The spelling of 42122332403431 in words is "forty-two trillion, one hundred twenty-two billion, three hundred thirty-two million, four hundred three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •