Base | Representation |
---|---|
bin | 1010000011001111000… |
… | …00110111001011100000 |
3 | 1020000100220221110101111 |
4 | 11001213200313023200 |
5 | 21124221004122202 |
6 | 422351055113104 |
7 | 33643462002010 |
oct | 5014740671340 |
9 | 1200326843344 |
10 | 345334051552 |
11 | 123501084206 |
12 | 56b17812794 |
13 | 26746000999 |
14 | 129ddcc9c40 |
15 | 8eb25d56d7 |
hex | 50678372e0 |
345334051552 has 24 divisors (see below), whose sum is σ = 777001616496. Its totient is φ = 148000307712.
The previous prime is 345334051549. The next prime is 345334051553. The reversal of 345334051552 is 255150433543.
It is a super-2 number, since 2×3453340515522 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (345334051553) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 770834713 + ... + 770835160.
It is an arithmetic number, because the mean of its divisors is an integer number (32375067354).
Almost surely, 2345334051552 is an apocalyptic number.
345334051552 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
345334051552 is an abundant number, since it is smaller than the sum of its proper divisors (431667564944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
345334051552 is a wasteful number, since it uses less digits than its factorization.
345334051552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1541669890 (or 1541669882 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 40.
The spelling of 345334051552 in words is "three hundred forty-five billion, three hundred thirty-four million, fifty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •