Base | Representation |
---|---|
bin | 1010000011110111000… |
… | …10100101000010101001 |
3 | 1020001020100011201221022 |
4 | 11001323202211002221 |
5 | 21130413012431430 |
6 | 422444300422225 |
7 | 33655011624164 |
oct | 5017342450251 |
9 | 1201210151838 |
10 | 345670045865 |
11 | 123663802761 |
12 | 56bb0247975 |
13 | 2679a7c1ca1 |
14 | 12a3278cadb |
15 | 8ed1d544e5 |
hex | 507b8a50a9 |
345670045865 has 8 divisors (see below), whose sum is σ = 415288078920. Its totient is φ = 276213354112.
The previous prime is 345670045849. The next prime is 345670045927. The reversal of 345670045865 is 568540076543.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 91479631936 + 254190413929 = 302456^2 + 504173^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 345670045865 - 24 = 345670045849 is a prime.
It is a super-2 number, since 2×3456700458652 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 40330610 + ... + 40339179.
It is an arithmetic number, because the mean of its divisors is an integer number (51911009865).
Almost surely, 2345670045865 is an apocalyptic number.
It is an amenable number.
345670045865 is a deficient number, since it is larger than the sum of its proper divisors (69618033055).
345670045865 is an equidigital number, since it uses as much as digits as its factorization.
345670045865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80670651.
The product of its (nonzero) digits is 12096000, while the sum is 53.
The spelling of 345670045865 in words is "three hundred forty-five billion, six hundred seventy million, forty-five thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •