Base | Representation |
---|---|
bin | 11111110010111111… |
… | …001110001010100001 |
3 | 10021010101010100220110 |
4 | 133302333032022201 |
5 | 1024410201233213 |
6 | 23403453201533 |
7 | 2316025241025 |
oct | 376277161241 |
9 | 107111110813 |
10 | 34141430433 |
11 | 1352aa47010 |
12 | 6749a902a9 |
13 | 32b13a4c56 |
14 | 191c496385 |
15 | d4c4d95c3 |
hex | 7f2fce2a1 |
34141430433 has 24 divisors (see below), whose sum is σ = 49996862496. Its totient is φ = 20552464000.
The previous prime is 34141430417. The next prime is 34141430443. The reversal of 34141430433 is 33403414143.
It is not a de Polignac number, because 34141430433 - 24 = 34141430417 is a prime.
It is a super-2 number, since 2×341414304332 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 34141430433.
It is not an unprimeable number, because it can be changed into a prime (34141430413) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 709333 + ... + 755933.
It is an arithmetic number, because the mean of its divisors is an integer number (2083202604).
Almost surely, 234141430433 is an apocalyptic number.
34141430433 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
34141430433 is a deficient number, since it is larger than the sum of its proper divisors (15855432063).
34141430433 is a wasteful number, since it uses less digits than its factorization.
34141430433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46913 (or 46764 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 34141430433 its reverse (33403414143), we get a palindrome (67544844576).
The spelling of 34141430433 in words is "thirty-four billion, one hundred forty-one million, four hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •