Base | Representation |
---|---|
bin | 10100100110010… |
… | …001011010000100 |
3 | 220002021010122120 |
4 | 110212101122010 |
5 | 1201431431332 |
6 | 54142525540 |
7 | 11364233250 |
oct | 2446213204 |
9 | 802233576 |
10 | 345577092 |
11 | 168084203 |
12 | 978968b0 |
13 | 56797cb3 |
14 | 33c79260 |
15 | 2051332c |
hex | 14991684 |
345577092 has 96 divisors (see below), whose sum is σ = 974668800. Its totient is φ = 93094272.
The previous prime is 345577091. The next prime is 345577117. The reversal of 345577092 is 290775543.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (345577091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 467259 + ... + 467997.
It is an arithmetic number, because the mean of its divisors is an integer number (10152800).
Almost surely, 2345577092 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 345577092, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (487334400).
345577092 is an abundant number, since it is smaller than the sum of its proper divisors (629091708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
345577092 is a wasteful number, since it uses less digits than its factorization.
345577092 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065 (or 1063 counting only the distinct ones).
The product of its (nonzero) digits is 264600, while the sum is 42.
The square root of 345577092 is about 18589.7039244847. The cubic root of 345577092 is about 701.7487514122.
The spelling of 345577092 in words is "three hundred forty-five million, five hundred seventy-seven thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •