Base | Representation |
---|---|
bin | 110100101001010000110110… |
… | …100111010000101110000111 |
3 | 1010100210102202110220022102001 |
4 | 310221100312213100232013 |
5 | 220321423124343121120 |
6 | 2140233131324330131 |
7 | 66524531455361005 |
oct | 6451206647205607 |
9 | 1110712673808361 |
10 | 231534013254535 |
11 | 67857029448302 |
12 | 21b74a146a3947 |
13 | 9c2674378c234 |
14 | 412643da89a75 |
15 | 1bb7ae732de0a |
hex | d294369d0b87 |
231534013254535 has 4 divisors (see below), whose sum is σ = 277840815905448. Its totient is φ = 185227210603624.
The previous prime is 231534013254463. The next prime is 231534013254553. The reversal of 231534013254535 is 535452310435132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 231534013254535 - 217 = 231534013123463 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23153401325449 + ... + 23153401325458.
It is an arithmetic number, because the mean of its divisors is an integer number (69460203976362).
Almost surely, 2231534013254535 is an apocalyptic number.
231534013254535 is a deficient number, since it is larger than the sum of its proper divisors (46306802650913).
231534013254535 is an equidigital number, since it uses as much as digits as its factorization.
231534013254535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46306802650912.
The product of its (nonzero) digits is 3240000, while the sum is 46.
Adding to 231534013254535 its reverse (535452310435132), we get a palindrome (766986323689667).
The spelling of 231534013254535 in words is "two hundred thirty-one trillion, five hundred thirty-four billion, thirteen million, two hundred fifty-four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •