Base | Representation |
---|---|
bin | 10011101001010100111… |
… | …011010000110010100001 |
3 | 11210001200221000010012011 |
4 | 103221110323100302201 |
5 | 134104342401133403 |
6 | 2512111340032521 |
7 | 166352235232360 |
oct | 23512473206241 |
9 | 4701627003164 |
10 | 1350044552353 |
11 | 480606a55072 |
12 | 199793232741 |
13 | 9a402165ab3 |
14 | 494b1b957d7 |
15 | 251b766aa6d |
hex | 13a54ed0ca1 |
1350044552353 has 8 divisors (see below), whose sum is σ = 1545187102272. Its totient is φ = 1155471763056.
The previous prime is 1350044552317. The next prime is 1350044552387. The reversal of 1350044552353 is 3532554400531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1350044552353 - 229 = 1349507681441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1350044552393) 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 7 ways as a sum of consecutive naturals, for example, 142435075 + ... + 142444552.
It is an arithmetic number, because the mean of its divisors is an integer number (193148387784).
Almost surely, 21350044552353 is an apocalyptic number.
It is an amenable number.
1350044552353 is a deficient number, since it is larger than the sum of its proper divisors (195142549919).
1350044552353 is an equidigital number, since it uses as much as digits as its factorization.
1350044552353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284880311.
The product of its (nonzero) digits is 540000, while the sum is 40.
Adding to 1350044552353 its reverse (3532554400531), we get a palindrome (4882598952884).
The spelling of 1350044552353 in words is "one trillion, three hundred fifty billion, forty-four million, five hundred fifty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •