Base | Representation |
---|---|
bin | 10011100101001000011… |
… | …100100100101100101110 |
3 | 11202122002000021222222002 |
4 | 103211020130210230232 |
5 | 134021131243313200 |
6 | 2510044352252302 |
7 | 166132512051311 |
oct | 23451034445456 |
9 | 4678060258862 |
10 | 1345540213550 |
11 | 479705410715 |
12 | 198936841092 |
13 | 99b64c00470 |
14 | 491a587a978 |
15 | 25001ec1bd5 |
hex | 13948724b2e |
1345540213550 has 48 divisors (see below), whose sum is σ = 2695341132960. Its totient is φ = 496792621440.
The previous prime is 1345540213531. The next prime is 1345540213553. The reversal of 1345540213550 is 553120455431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1345540213553) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 24472991 + ... + 24527909.
It is an arithmetic number, because the mean of its divisors is an integer number (56152940270).
Almost surely, 21345540213550 is an apocalyptic number.
1345540213550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1345540213550 is an abundant number, since it is smaller than the sum of its proper divisors (1349800919410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1345540213550 is a wasteful number, since it uses less digits than its factorization.
1345540213550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92637 (or 92632 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 38.
Adding to 1345540213550 its reverse (553120455431), we get a palindrome (1898660668981).
The spelling of 1345540213550 in words is "one trillion, three hundred forty-five billion, five hundred forty million, two hundred thirteen thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •