Base | Representation |
---|---|
bin | 1010000101001011001… |
… | …10001110100010101100 |
3 | 1020010001111212220110210 |
4 | 11002211212032202230 |
5 | 21133334131122411 |
6 | 423042304102420 |
7 | 34011340256436 |
oct | 5024546164254 |
9 | 1203044786423 |
10 | 346375645356 |
11 | 123996027034 |
12 | 57168604a10 |
13 | 26880a41c90 |
14 | 12a9c383656 |
15 | 9023c80ca6 |
hex | 50a598e8ac |
346375645356 has 48 divisors (see below), whose sum is σ = 916189299200. Its totient is φ = 100967798592.
The previous prime is 346375645351. The next prime is 346375645361. The reversal of 346375645356 is 653546573643.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (346375645351) and next prime (346375645361).
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 346375645296 and 346375645305.
It is not an unprimeable number, because it can be changed into a prime (346375645351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58427476 + ... + 58433403.
Almost surely, 2346375645356 is an apocalyptic number.
It is an amenable number.
346375645356 is an abundant number, since it is smaller than the sum of its proper divisors (569813653844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
346375645356 is a wasteful number, since it uses less digits than its factorization.
346375645356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116860918 (or 116860916 counting only the distinct ones).
The product of its digits is 81648000, while the sum is 57.
The spelling of 346375645356 in words is "three hundred forty-six billion, three hundred seventy-five million, six hundred forty-five thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •