Base | Representation |
---|---|
bin | 10000000000101… |
… | …11110000001110 |
3 | 100100201220120110 |
4 | 20000113300032 |
5 | 233341040042 |
6 | 21154500450 |
7 | 3220441662 |
oct | 1000276016 |
9 | 310656513 |
10 | 134315022 |
11 | 698a9956 |
12 | 38b94726 |
13 | 21a9985a |
14 | 13ba48a2 |
15 | bbd209c |
hex | 8017c0e |
134315022 has 8 divisors (see below), whose sum is σ = 268630056. Its totient is φ = 44771672.
The previous prime is 134315021. The next prime is 134315023. The reversal of 134315022 is 220513431.
It is an interprime number because it is at equal distance from previous prime (134315021) and next prime (134315023).
It is a sphenic number, since it is the product of 3 distinct primes.
134315022 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 134315022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134315021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11192913 + ... + 11192924.
It is an arithmetic number, because the mean of its divisors is an integer number (33578757).
Almost surely, 2134315022 is an apocalyptic number.
134315022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134315022 is a wasteful number, since it uses less digits than its factorization.
134315022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22385842.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 134315022 is about 11589.4357929970. The cubic root of 134315022 is about 512.1236858369.
Adding to 134315022 its reverse (220513431), we get a palindrome (354828453).
The spelling of 134315022 in words is "one hundred thirty-four million, three hundred fifteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •