Base | Representation |
---|---|
bin | 1110001010101001001110… |
… | …01001001111011111001011 |
3 | 11002022002220020112201222002 |
4 | 13011110213021033133023 |
5 | 13040343401430011133 |
6 | 150131020054021215 |
7 | 6363442644342644 |
oct | 705244711173713 |
9 | 132262806481862 |
10 | 31152054532043 |
11 | 9a2056a718465 |
12 | 35b158804780b |
13 | 144c81a815773 |
14 | 799aa5d966cb |
15 | 39050a6a4ce8 |
hex | 1c552724f7cb |
31152054532043 has 8 divisors (see below), whose sum is σ = 32227057516800. Its totient is φ = 30077104494528.
The previous prime is 31152054532009. The next prime is 31152054532073. The reversal of 31152054532043 is 34023545025113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31152054532043 - 210 = 31152054531019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31152054531988 and 31152054532006.
It is not an unprimeable number, because it can be changed into a prime (31152054532073) 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, 12037946 + ... + 14395007.
It is an arithmetic number, because the mean of its divisors is an integer number (4028382189600).
Almost surely, 231152054532043 is an apocalyptic number.
31152054532043 is a deficient number, since it is larger than the sum of its proper divisors (1075002984757).
31152054532043 is a wasteful number, since it uses less digits than its factorization.
31152054532043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26473621.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 31152054532043 its reverse (34023545025113), we get a palindrome (65175599557156).
The spelling of 31152054532043 in words is "thirty-one trillion, one hundred fifty-two billion, fifty-four million, five hundred thirty-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •