Base | Representation |
---|---|
bin | 10010001111111110100110… |
… | …11001000111111010100011 |
3 | 12021002112020002011211122121 |
4 | 21013333103121013322203 |
5 | 20230003130030300443 |
6 | 221204042252045111 |
7 | 11311254101605516 |
oct | 1107772331077243 |
9 | 167075202154577 |
10 | 40131426025123 |
11 | 11872707848a64 |
12 | 46018a5463797 |
13 | 19514b9a30734 |
14 | 9ca52b10cd7d |
15 | 498d9cd664ed |
hex | 247fd3647ea3 |
40131426025123 has 4 divisors (see below), whose sum is σ = 40138370385640. Its totient is φ = 40124481664608.
The previous prime is 40131426025111. The next prime is 40131426025169. The reversal of 40131426025123 is 32152062413104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40131426025123 is a prime.
It is a super-2 number, since 2×401314260251232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40131426085123) 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, 3472171590 + ... + 3472183147.
It is an arithmetic number, because the mean of its divisors is an integer number (10034592596410).
Almost surely, 240131426025123 is an apocalyptic number.
40131426025123 is a deficient number, since it is larger than the sum of its proper divisors (6944360517).
40131426025123 is an equidigital number, since it uses as much as digits as its factorization.
40131426025123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6944360516.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 40131426025123 its reverse (32152062413104), we get a palindrome (72283488438227).
The spelling of 40131426025123 in words is "forty trillion, one hundred thirty-one billion, four hundred twenty-six million, twenty-five thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •