Base | Representation |
---|---|
bin | 10010001111010001001… |
… | …001000101110110100110 |
3 | 11102211002201102112222210 |
4 | 102033101021011312212 |
5 | 131013322120221200 |
6 | 2355440050104250 |
7 | 156360016544562 |
oct | 22172111056646 |
9 | 4384081375883 |
10 | 1253344304550 |
11 | 4435a42046a8 |
12 | 182aa657b086 |
13 | 9126117c960 |
14 | 4493b0886a2 |
15 | 22907e85650 |
hex | 123d1245da6 |
1253344304550 has 96 divisors (see below), whose sum is σ = 3380536444320. Its totient is φ = 305460864000.
The previous prime is 1253344304543. The next prime is 1253344304561. The reversal of 1253344304550 is 554034433521.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 1253344304499 and 1253344304508.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 2984935 + ... + 3378834.
It is an arithmetic number, because the mean of its divisors is an integer number (35213921295).
Almost surely, 21253344304550 is an apocalyptic number.
1253344304550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1253344304550 is an abundant number, since it is smaller than the sum of its proper divisors (2127192139770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1253344304550 is a wasteful number, since it uses less digits than its factorization.
1253344304550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6363898 (or 6363893 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 39.
The spelling of 1253344304550 in words is "one trillion, two hundred fifty-three billion, three hundred forty-four million, three hundred four thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •