Base | Representation |
---|---|
bin | 11111110111110000… |
… | …011001010110000111 |
3 | 10021022221122202212222 |
4 | 133313300121112013 |
5 | 1030041141231101 |
6 | 23415432002555 |
7 | 2321016233246 |
oct | 376760312607 |
9 | 107287582788 |
10 | 34221430151 |
11 | 13571117a87 |
12 | 677083045b |
13 | 32c4b3516c |
14 | 1928d5c95d |
15 | d5453d01b |
hex | 7f7c19587 |
34221430151 has 8 divisors (see below), whose sum is σ = 36236443824. Its totient is φ = 32206637440.
The previous prime is 34221430147. The next prime is 34221430181. The reversal of 34221430151 is 15103412243.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 34221430151 - 22 = 34221430147 is a prime.
It is a super-2 number, since 2×342214301512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 34221430151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34221430181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 347636 + ... + 435078.
It is an arithmetic number, because the mean of its divisors is an integer number (4529555478).
Almost surely, 234221430151 is an apocalyptic number.
34221430151 is a deficient number, since it is larger than the sum of its proper divisors (2015013673).
34221430151 is a wasteful number, since it uses less digits than its factorization.
34221430151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110481.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 34221430151 its reverse (15103412243), we get a palindrome (49324842394).
The spelling of 34221430151 in words is "thirty-four billion, two hundred twenty-one million, four hundred thirty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •