Base | Representation |
---|---|
bin | 1110010101111100101011… |
… | …00100001010110001111011 |
3 | 11010200020102110221012010002 |
4 | 13022332111210022301323 |
5 | 13113224322230003201 |
6 | 151025252401343215 |
7 | 6433502566503032 |
oct | 712762544126173 |
9 | 133606373835102 |
10 | 31540454141051 |
11 | a060260117369 |
12 | 3654902337b0b |
13 | 147a337a2490b |
14 | 7b07cd63d719 |
15 | 39a68d96576b |
hex | 1caf9590ac7b |
31540454141051 has 4 divisors (see below), whose sum is σ = 31625012999712. Its totient is φ = 31455895282392.
The previous prime is 31540454141023. The next prime is 31540454141101. The reversal of 31540454141051 is 15014145404513.
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-31540454141051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31540454140996 and 31540454141014.
It is not an unprimeable number, because it can be changed into a prime (31540454141011) 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, 42279428771 + ... + 42279429516.
It is an arithmetic number, because the mean of its divisors is an integer number (7906253249928).
Almost surely, 231540454141051 is an apocalyptic number.
31540454141051 is a deficient number, since it is larger than the sum of its proper divisors (84558858661).
31540454141051 is an equidigital number, since it uses as much as digits as its factorization.
31540454141051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84558858660.
The product of its (nonzero) digits is 96000, while the sum is 38.
Adding to 31540454141051 its reverse (15014145404513), we get a palindrome (46554599545564).
The spelling of 31540454141051 in words is "thirty-one trillion, five hundred forty billion, four hundred fifty-four million, one hundred forty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •