Base | Representation |
---|---|
bin | 100111011011111110101011… |
… | …1100111001010101001101000 |
3 | 1200111020122201010100201102112 |
4 | 1032313331113213022221220 |
5 | 330431444023412343224 |
6 | 3225440253120221452 |
7 | 133032125144430644 |
oct | 11667752747125150 |
9 | 1614218633321375 |
10 | 346893093481064 |
11 | a0592597870949 |
12 | 32aa625716a888 |
13 | 11b73b55982a70 |
14 | 6193a02b41c24 |
15 | 2a1874353e30e |
hex | 13b7f579caa68 |
346893093481064 has 64 divisors (see below), whose sum is σ = 712924386451200. Its totient is φ = 157275438937344.
The previous prime is 346893093481061. The next prime is 346893093481073. The reversal of 346893093481064 is 460184390398643.
It is a junction number, because it is equal to n+sod(n) for n = 346893093480985 and 346893093481003.
It is not an unprimeable number, because it can be changed into a prime (346893093481061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105543002 + ... + 108780105.
It is an arithmetic number, because the mean of its divisors is an integer number (11139443538300).
Almost surely, 2346893093481064 is an apocalyptic number.
It is an amenable number.
346893093481064 is an abundant number, since it is smaller than the sum of its proper divisors (366031292970136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
346893093481064 is a wasteful number, since it uses less digits than its factorization.
346893093481064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214323402 (or 214323398 counting only the distinct ones).
The product of its (nonzero) digits is 322486272, while the sum is 68.
The spelling of 346893093481064 in words is "three hundred forty-six trillion, eight hundred ninety-three billion, ninety-three million, four hundred eighty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •