Base | Representation |
---|---|
bin | 11110110011000100111001… |
… | …100111010111000000000101 |
3 | 122202121000121111012220101202 |
4 | 132303010321213113000011 |
5 | 120223213331124424333 |
6 | 1200025254040232245 |
7 | 40350015505146206 |
oct | 3663047147270005 |
9 | 582530544186352 |
10 | 135451350233093 |
11 | 3a18265aaa7254 |
12 | 1323746716b685 |
13 | 5a7701369c99b |
14 | 2563c478b35ad |
15 | 109d60186c5e8 |
hex | 7b31399d7005 |
135451350233093 has 8 divisors (see below), whose sum is σ = 135468002712576. Its totient is φ = 135434698290000.
The previous prime is 135451350233063. The next prime is 135451350233159. The reversal of 135451350233093 is 390332053154531.
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 135451350233093 - 210 = 135451350232069 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 (135451350233063) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 753493580 + ... + 753673322.
It is an arithmetic number, because the mean of its divisors is an integer number (16933500339072).
Almost surely, 2135451350233093 is an apocalyptic number.
It is an amenable number.
135451350233093 is a deficient number, since it is larger than the sum of its proper divisors (16652479483).
135451350233093 is an equidigital number, since it uses as much as digits as its factorization.
135451350233093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268195.
The product of its (nonzero) digits is 2187000, while the sum is 47.
The spelling of 135451350233093 in words is "one hundred thirty-five trillion, four hundred fifty-one billion, three hundred fifty million, two hundred thirty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •