Base | Representation |
---|---|
bin | 111110100110000110… |
… | …0000101000011110001 |
3 | 110211222010010100110022 |
4 | 1331030030011003301 |
5 | 4200244042033131 |
6 | 141430330413225 |
7 | 12466052012033 |
oct | 1751414050361 |
9 | 424863110408 |
10 | 134422221041 |
11 | 5200a926269 |
12 | 22075891215 |
13 | c8a3117b84 |
14 | 6712929c53 |
15 | 376b1db37b |
hex | 1f4c3050f1 |
134422221041 has 8 divisors (see below), whose sum is σ = 149820432480. Its totient is φ = 119856345408.
The previous prime is 134422221023. The next prime is 134422221047. The reversal of 134422221041 is 140122224431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134422221041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134422221041.
It is not an unprimeable number, because it can be changed into a prime (134422221047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 208083611 + ... + 208084256.
It is an arithmetic number, because the mean of its divisors is an integer number (18727554060).
Almost surely, 2134422221041 is an apocalyptic number.
It is an amenable number.
134422221041 is a deficient number, since it is larger than the sum of its proper divisors (15398211439).
134422221041 is a wasteful number, since it uses less digits than its factorization.
134422221041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416167903.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 134422221041 its reverse (140122224431), we get a palindrome (274544445472).
The spelling of 134422221041 in words is "one hundred thirty-four billion, four hundred twenty-two million, two hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •