Base | Representation |
---|---|
bin | 10011100100111011111… |
… | …011011011111111101000 |
3 | 11202121112101010020021220 |
4 | 103210323323123333220 |
5 | 134020214012404202 |
6 | 2510011451102040 |
7 | 166124352011442 |
oct | 23447373337750 |
9 | 4677471106256 |
10 | 1345330200552 |
11 | 479607909858 |
12 | 198898441920 |
13 | 99b3054b710 |
14 | 49185a0d492 |
15 | 24edd83aabc |
hex | 1393bedbfe8 |
1345330200552 has 64 divisors (see below), whose sum is σ = 3623471544000. Its totient is φ = 413784474624.
The previous prime is 1345330200547. The next prime is 1345330200553. The reversal of 1345330200552 is 2550020335431.
It is a super-2 number, since 2×13453302005522 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1345330200553) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56977 + ... + 1641312.
It is an arithmetic number, because the mean of its divisors is an integer number (56616742875).
Almost surely, 21345330200552 is an apocalyptic number.
1345330200552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1345330200552 is an abundant number, since it is smaller than the sum of its proper divisors (2278141343448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1345330200552 is a wasteful number, since it uses less digits than its factorization.
1345330200552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700850 (or 1700846 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 33.
Adding to 1345330200552 its reverse (2550020335431), we get a palindrome (3895350535983).
The spelling of 1345330200552 in words is "one trillion, three hundred forty-five billion, three hundred thirty million, two hundred thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •