Base | Representation |
---|---|
bin | 111110110000010111… |
… | …1010011110000101101 |
3 | 110212212010212222010101 |
4 | 1331200233103300231 |
5 | 4202000323004441 |
6 | 141524444311101 |
7 | 12510436414231 |
oct | 1754057236055 |
9 | 425763788111 |
10 | 134767000621 |
11 | 52177505270 |
12 | 22151242491 |
13 | c929693b66 |
14 | 67466385c1 |
15 | 378b5e3231 |
hex | 1f60bd3c2d |
134767000621 has 8 divisors (see below), whose sum is σ = 147378009600. Its totient is φ = 122215902240.
The previous prime is 134767000619. The next prime is 134767000651. The reversal of 134767000621 is 126000767431.
It is the 149871-st star number.
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 134767000621 - 21 = 134767000619 is a prime.
It is a super-2 number, since 2×1347670006212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134767000651) 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, 14972941 + ... + 14981938.
It is an arithmetic number, because the mean of its divisors is an integer number (18422251200).
Almost surely, 2134767000621 is an apocalyptic number.
134767000621 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134767000621 is a deficient number, since it is larger than the sum of its proper divisors (12611008979).
134767000621 is a wasteful number, since it uses less digits than its factorization.
134767000621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29955299.
The product of its (nonzero) digits is 42336, while the sum is 37.
The spelling of 134767000621 in words is "one hundred thirty-four billion, seven hundred sixty-seven million, six hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •