Base | Representation |
---|---|
bin | 111110100011011000… |
… | …0001101101011000101 |
3 | 110211201202112101011020 |
4 | 1331012300031223011 |
5 | 4200102220431323 |
6 | 141413312101353 |
7 | 12463563626412 |
oct | 1750660155305 |
9 | 424652471136 |
10 | 134331030213 |
11 | 51a73401246 |
12 | 2204b234859 |
13 | c88a269bc3 |
14 | 670478d109 |
15 | 37631c6ae3 |
hex | 1f46c0dac5 |
134331030213 has 8 divisors (see below), whose sum is σ = 179691455328. Its totient is φ = 89262312624.
The previous prime is 134331030143. The next prime is 134331030263. The reversal of 134331030213 is 312030133431.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134331030213 - 28 = 134331029957 is a prime.
It is a super-3 number, since 3×1343310302133 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134331030263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72925806 + ... + 72927647.
It is an arithmetic number, because the mean of its divisors is an integer number (22461431916).
Almost surely, 2134331030213 is an apocalyptic number.
It is an amenable number.
134331030213 is a deficient number, since it is larger than the sum of its proper divisors (45360425115).
134331030213 is a wasteful number, since it uses less digits than its factorization.
134331030213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145853763.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 134331030213 its reverse (312030133431), we get a palindrome (446361163644).
The spelling of 134331030213 in words is "one hundred thirty-four billion, three hundred thirty-one million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •