Base | Representation |
---|---|
bin | 10100100100010… |
… | …011011100011001 |
3 | 220001021220220102 |
4 | 110210103130121 |
5 | 1201313424040 |
6 | 54123505145 |
7 | 11356654112 |
oct | 2444233431 |
9 | 801256812 |
10 | 345061145 |
11 | 167861600 |
12 | 976881b5 |
13 | 566471c0 |
14 | 33b83209 |
15 | 20460515 |
hex | 14913719 |
345061145 has 48 divisors (see below), whose sum is σ = 497690256. Its totient is φ = 228096000.
The previous prime is 345061141. The next prime is 345061151. The reversal of 345061145 is 541160543.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 698896 + 344362249 = 836^2 + 18557^2 .
It is not a de Polignac number, because 345061145 - 22 = 345061141 is a prime.
It is a super-2 number, since 2×3450611452 = 238134387577422050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (345061141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 573845 + ... + 574445.
It is an arithmetic number, because the mean of its divisors is an integer number (10368547).
Almost surely, 2345061145 is an apocalyptic number.
It is an amenable number.
345061145 is a deficient number, since it is larger than the sum of its proper divisors (152629111).
345061145 is a wasteful number, since it uses less digits than its factorization.
345061145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714 (or 703 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 345061145 is about 18575.8215161537. The cubic root of 345061145 is about 701.3993402302.
The spelling of 345061145 in words is "three hundred forty-five million, sixty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •