Base | Representation |
---|---|
bin | 10000000001010… |
… | …10101110110001 |
3 | 100100212212012101 |
4 | 20000222232301 |
5 | 233401032003 |
6 | 21200300401 |
7 | 3221214415 |
oct | 1000525661 |
9 | 310785171 |
10 | 134392753 |
11 | 699522a0 |
12 | 39011701 |
13 | 21ac6051 |
14 | 13bc4d45 |
15 | bbea11d |
hex | 802abb1 |
134392753 has 16 divisors (see below), whose sum is σ = 148682304. Its totient is φ = 120463360.
The previous prime is 134392751. The next prime is 134392771. The reversal of 134392753 is 357293431.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 134392753 - 21 = 134392751 is a prime.
It is a super-2 number, since 2×1343927532 = 36122824117838018, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134392751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 387126 + ... + 387472.
It is an arithmetic number, because the mean of its divisors is an integer number (9292644).
Almost surely, 2134392753 is an apocalyptic number.
It is an amenable number.
134392753 is a deficient number, since it is larger than the sum of its proper divisors (14289551).
134392753 is a wasteful number, since it uses less digits than its factorization.
134392753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 752.
The product of its digits is 68040, while the sum is 37.
The square root of 134392753 is about 11592.7888361688. The cubic root of 134392753 is about 512.2224591259. Note that the first 3 decimals are identical.
It can be divided in two parts, 1343927 and 53, that added together give a triangular number (1343980 = T1639).
The spelling of 134392753 in words is "one hundred thirty-four million, three hundred ninety-two thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •