Base | Representation |
---|---|
bin | 10011101001110011111… |
… | …100110011111001100000 |
3 | 11210010001012102020110212 |
4 | 103221303330303321200 |
5 | 134111424123131000 |
6 | 2512235132113252 |
7 | 166401155346143 |
oct | 23516374637140 |
9 | 4703035366425 |
10 | 1350565052000 |
11 | 48085384316a |
12 | 1998b9605828 |
13 | 9a485c47858 |
14 | 49520d6605a |
15 | 251e81d2c35 |
hex | 13a73f33e60 |
1350565052000 has 48 divisors (see below), whose sum is σ = 3318338342592. Its totient is φ = 540226019200.
The previous prime is 1350565051999. The next prime is 1350565052063. The reversal of 1350565052000 is 2505650531.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168816632 + ... + 168824631.
It is an arithmetic number, because the mean of its divisors is an integer number (69132048804).
Almost surely, 21350565052000 is an apocalyptic number.
1350565052000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1350565052000 is an abundant number, since it is smaller than the sum of its proper divisors (1967773290592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1350565052000 is an equidigital number, since it uses as much as digits as its factorization.
1350565052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337641288 (or 337641270 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 32.
The spelling of 1350565052000 in words is "one trillion, three hundred fifty billion, five hundred sixty-five million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •