Base | Representation |
---|---|
bin | 11111110010101101… |
… | …010001101110100000 |
3 | 10021010001021101020012 |
4 | 133302231101232200 |
5 | 1024403000221212 |
6 | 23403204304052 |
7 | 2315640246524 |
oct | 376255215640 |
9 | 107101241205 |
10 | 34136726432 |
11 | 13528323906 |
12 | 67483a2028 |
13 | 32b0418b13 |
14 | 191b9cdd84 |
15 | d4bdaa922 |
hex | 7f2b51ba0 |
34136726432 has 12 divisors (see below), whose sum is σ = 67206680226. Its totient is φ = 17068363200.
The previous prime is 34136726423. The next prime is 34136726441. The reversal of 34136726432 is 23462763143.
It is an interprime number because it is at equal distance from previous prime (34136726423) and next prime (34136726441).
It can be written as a sum of positive squares in only one way, i.e., 21130692496 + 13006033936 = 145364^2 + 114044^2 .
It is a super-3 number, since 3×341367264323 (a number of 33 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 34136726432.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 533386319 + ... + 533386382.
Almost surely, 234136726432 is an apocalyptic number.
34136726432 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
34136726432 is a deficient number, since it is larger than the sum of its proper divisors (33069953794).
34136726432 is a wasteful number, since it uses less digits than its factorization.
34136726432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1066772711 (or 1066772703 counting only the distinct ones).
The product of its digits is 435456, while the sum is 41.
The spelling of 34136726432 in words is "thirty-four billion, one hundred thirty-six million, seven hundred twenty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •