Base | Representation |
---|---|
bin | 1110001010010010111110… |
… | …11111100101001111101111 |
3 | 11002020222002011020012112002 |
4 | 13011021133133211033233 |
5 | 13040144423420314133 |
6 | 150121323224402515 |
7 | 6362541036155240 |
oct | 705113737451757 |
9 | 132228064205462 |
10 | 31140115010543 |
11 | 9a164a3114220 |
12 | 35ab1b561643b |
13 | 144b667067946 |
14 | 7992923dccc7 |
15 | 39005c3cdce8 |
hex | 1c525f7e53ef |
31140115010543 has 8 divisors (see below), whose sum is σ = 38824039493760. Its totient is φ = 24265024683480.
The previous prime is 31140115010531. The next prime is 31140115010579. The reversal of 31140115010543 is 34501051104113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31140115010543 - 214 = 31140114994159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31140115010443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202208538953 + ... + 202208539106.
It is an arithmetic number, because the mean of its divisors is an integer number (4853004936720).
Almost surely, 231140115010543 is an apocalyptic number.
31140115010543 is a deficient number, since it is larger than the sum of its proper divisors (7683924483217).
31140115010543 is a wasteful number, since it uses less digits than its factorization.
31140115010543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404417078077.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 31140115010543 its reverse (34501051104113), we get a palindrome (65641166114656).
The spelling of 31140115010543 in words is "thirty-one trillion, one hundred forty billion, one hundred fifteen million, ten thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •