Base | Representation |
---|---|
bin | 111110011101000111… |
… | …1110111010010011010 |
3 | 110211012010202002012122 |
4 | 1330322033313102122 |
5 | 4144140013121242 |
6 | 141340415141242 |
7 | 12455435405462 |
oct | 1747217672232 |
9 | 424163662178 |
10 | 134121223322 |
11 | 51975a30219 |
12 | 21bb0b14822 |
13 | c85595ac08 |
14 | 66c4976ba2 |
15 | 374ea81ad2 |
hex | 1f3a3f749a |
134121223322 has 8 divisors (see below), whose sum is σ = 202514165472. Its totient is φ = 66616501500.
The previous prime is 134121223289. The next prime is 134121223337. The reversal of 134121223322 is 223322121431.
134121223322 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1341212233223 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134121223291 and 134121223300.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 222054704 + ... + 222055307.
It is an arithmetic number, because the mean of its divisors is an integer number (25314270684).
Almost surely, 2134121223322 is an apocalyptic number.
134121223322 is a deficient number, since it is larger than the sum of its proper divisors (68392942150).
134121223322 is a wasteful number, since it uses less digits than its factorization.
134121223322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444110164.
The product of its digits is 3456, while the sum is 26.
Adding to 134121223322 its reverse (223322121431), we get a palindrome (357443344753).
The spelling of 134121223322 in words is "one hundred thirty-four billion, one hundred twenty-one million, two hundred twenty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •