Base | Representation |
---|---|
bin | 1010000010110111011… |
… | …10101011010010001010 |
3 | 1012222212010220222200220 |
4 | 11001123232223102022 |
5 | 21123314401040000 |
6 | 422315313410510 |
7 | 33635541352503 |
oct | 5013356532212 |
9 | 1188763828626 |
10 | 345136346250 |
11 | 12340a5192a3 |
12 | 56a81569a36 |
13 | 2671406acb7 |
14 | 129c1943baa |
15 | 8ea00811a0 |
hex | 505bbab48a |
345136346250 has 80 divisors (see below), whose sum is σ = 875439494688. Its totient is φ = 90662616000.
The previous prime is 345136346227. The next prime is 345136346273. The reversal of 345136346250 is 52643631543.
It is an interprime number because it is at equal distance from previous prime (345136346227) and next prime (345136346273).
It is a super-3 number, since 3×3451363462503 (a number of 36 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 435589 + ... + 938088.
Almost surely, 2345136346250 is an apocalyptic number.
345136346250 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
345136346250 is an abundant number, since it is smaller than the sum of its proper divisors (530303148438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
345136346250 is a wasteful number, since it uses less digits than its factorization.
345136346250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1373769 (or 1373754 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 42.
Adding to 345136346250 its reverse (52643631543), we get a palindrome (397779977793).
The spelling of 345136346250 in words is "three hundred forty-five billion, one hundred thirty-six million, three hundred forty-six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •