Base | Representation |
---|---|
bin | 111110101100000011… |
… | …0010011010111000110 |
3 | 110212111001002212102012 |
4 | 1331120012103113012 |
5 | 4201201220031400 |
6 | 141502225214222 |
7 | 12504026255150 |
oct | 1753006232706 |
9 | 425431085365 |
10 | 134622033350 |
11 | 521026a0202 |
12 | 22110791372 |
13 | c9056378cc |
14 | 673129dad0 |
15 | 377da09d35 |
hex | 1f581935c6 |
134622033350 has 24 divisors (see below), whose sum is σ = 286167980208. Its totient is φ = 46156125600.
The previous prime is 134622033341. The next prime is 134622033353. The reversal of 134622033350 is 53330226431.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134622033353) 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 11 ways as a sum of consecutive naturals, for example, 192316841 + ... + 192317540.
It is an arithmetic number, because the mean of its divisors is an integer number (11923665842).
Almost surely, 2134622033350 is an apocalyptic number.
134622033350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134622033350 is an abundant number, since it is smaller than the sum of its proper divisors (151545946858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134622033350 is a wasteful number, since it uses less digits than its factorization.
134622033350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384634400 (or 384634395 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 32.
Adding to 134622033350 its reverse (53330226431), we get a palindrome (187952259781).
The spelling of 134622033350 in words is "one hundred thirty-four billion, six hundred twenty-two million, thirty-three thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •