Base | Representation |
---|---|
bin | 10000000000000… |
… | …10000001101110 |
3 | 100100120101111110 |
4 | 20000002001232 |
5 | 233330213110 |
6 | 21152532450 |
7 | 3216621351 |
oct | 1000020156 |
9 | 310511443 |
10 | 134226030 |
11 | 69849004 |
12 | 38b51126 |
13 | 21a681b3 |
14 | 13b80298 |
15 | bbb5a20 |
hex | 800206e |
134226030 has 16 divisors (see below), whose sum is σ = 322142544. Its totient is φ = 35793600.
The previous prime is 134226019. The next prime is 134226061. The reversal of 134226030 is 30622431.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 134225988 and 134226006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2237071 + ... + 2237130.
It is an arithmetic number, because the mean of its divisors is an integer number (20133909).
Almost surely, 2134226030 is an apocalyptic number.
134226030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134226030 is an abundant number, since it is smaller than the sum of its proper divisors (187916514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134226030 is a wasteful number, since it uses less digits than its factorization.
134226030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4474211.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 134226030 is about 11585.5957982315. The cubic root of 134226030 is about 512.0105563212.
Adding to 134226030 its reverse (30622431), we get a palindrome (164848461).
It can be divided in two parts, 1342 and 26030, that added together give a palindrome (27372).
The spelling of 134226030 in words is "one hundred thirty-four million, two hundred twenty-six thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •