Base | Representation |
---|---|
bin | 10100100110011… |
… | …010010100100001 |
3 | 220002022222201202 |
4 | 110212122110201 |
5 | 1201434113401 |
6 | 54143410545 |
7 | 11364444554 |
oct | 2446322441 |
9 | 802288652 |
10 | 345613601 |
11 | 1680a9683 |
12 | 978b3a55 |
13 | 567ab7b8 |
14 | 33c8869b |
15 | 2051e06b |
hex | 1499a521 |
345613601 has 4 divisors (see below), whose sum is σ = 345660672. Its totient is φ = 345566532.
The previous prime is 345613579. The next prime is 345613669. The reversal of 345613601 is 106316543.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 106316543 = 73 ⋅1456391.
It is a cyclic number.
It is not a de Polignac number, because 345613601 - 210 = 345612577 is a prime.
It is a super-2 number, since 2×3456136012 = 238897522392374402, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (345613201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9881 + ... + 28086.
It is an arithmetic number, because the mean of its divisors is an integer number (86415168).
Almost surely, 2345613601 is an apocalyptic number.
It is an amenable number.
345613601 is a deficient number, since it is larger than the sum of its proper divisors (47071).
345613601 is an equidigital number, since it uses as much as digits as its factorization.
345613601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47070.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 345613601 is about 18590.6858668528. The cubic root of 345613601 is about 701.7734629682.
The spelling of 345613601 in words is "three hundred forty-five million, six hundred thirteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •