Base | Representation |
---|---|
bin | 1010000101001011100… |
… | …11000111111010100100 |
3 | 1020010001202020122221221 |
4 | 11002211303013322210 |
5 | 21133341012313314 |
6 | 423042504350124 |
7 | 34011411100000 |
oct | 5024563077244 |
9 | 1203052218857 |
10 | 346379026084 |
11 | 123997a26023 |
12 | 57169775344 |
13 | 26881656a00 |
14 | 12a9c9c3700 |
15 | 90241ec824 |
hex | 50a5cc7ea4 |
346379026084 has 216 divisors, whose sum is σ = 784681571520. Its totient is φ = 133653566592.
The previous prime is 346379026067. The next prime is 346379026099. The reversal of 346379026084 is 480620973643.
It is a happy number.
It is a super-3 number, since 3×3463790260843 (a number of 36 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
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 in 71 ways as a sum of consecutive naturals, for example, 488545522 + ... + 488546230.
Almost surely, 2346379026084 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 346379026084, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (392340785760).
346379026084 is an abundant number, since it is smaller than the sum of its proper divisors (438302545436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
346379026084 is an equidigital number, since it uses as much as digits as its factorization.
346379026084 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817 (or 774 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 52.
The spelling of 346379026084 in words is "three hundred forty-six billion, three hundred seventy-nine million, twenty-six thousand, eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •