Base | Representation |
---|---|
bin | 10101001000010101… |
… | …10110111010000001 |
3 | 1002021121012022201021 |
4 | 22210022312322001 |
5 | 141213111304403 |
6 | 5113402305441 |
7 | 551056325461 |
oct | 124412667201 |
9 | 32247168637 |
10 | 11344244353 |
11 | 48a1591762 |
12 | 22471b8281 |
13 | 10ba346b30 |
14 | 7988bdba1 |
15 | 465ddc8bd |
hex | 2a42b6e81 |
11344244353 has 8 divisors (see below), whose sum is σ = 12240887400. Its totient is φ = 10451031168.
The previous prime is 11344244341. The next prime is 11344244357. The reversal of 11344244353 is 35344244311.
It can be written as a sum of positive squares in 4 ways, for example, as 2279871504 + 9064372849 = 47748^2 + 95207^2 .
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 11344244353 - 25 = 11344244321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11344244357) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 850588 + ... + 863821.
It is an arithmetic number, because the mean of its divisors is an integer number (1530110925).
Almost surely, 211344244353 is an apocalyptic number.
11344244353 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11344244353 is a deficient number, since it is larger than the sum of its proper divisors (896643047).
11344244353 is a wasteful number, since it uses less digits than its factorization.
11344244353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1714931.
The product of its digits is 69120, while the sum is 34.
Adding to 11344244353 its reverse (35344244311), we get a palindrome (46688488664).
The spelling of 11344244353 in words is "eleven billion, three hundred forty-four million, two hundred forty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •