Base | Representation |
---|---|
bin | 10011100100000101001… |
… | …011000100110110110011 |
3 | 11202112011100112010001000 |
4 | 103210011023010312303 |
5 | 134011323324200303 |
6 | 2505340353213043 |
7 | 166062525436335 |
oct | 23440513046663 |
9 | 4675140463030 |
10 | 1344411553203 |
11 | 479186300474 |
12 | 198680861183 |
13 | 99a151264c4 |
14 | 490d99db455 |
15 | 24e87d78da3 |
hex | 139052c4db3 |
1344411553203 has 16 divisors (see below), whose sum is σ = 1993846492960. Its totient is φ = 895317815808.
The previous prime is 1344411553201. The next prime is 1344411553207. The reversal of 1344411553203 is 3023551144431.
1344411553203 is a `hidden beast` number, since 1 + 3 + 4 + 4 + 4 + 115 + 532 + 0 + 3 = 666.
It is not a de Polignac number, because 1344411553203 - 21 = 1344411553201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1344411553201) 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 15 ways as a sum of consecutive naturals, for example, 26545150 + ... + 26595747.
It is an arithmetic number, because the mean of its divisors is an integer number (124615405810).
Almost surely, 21344411553203 is an apocalyptic number.
1344411553203 is a deficient number, since it is larger than the sum of its proper divisors (649434939757).
1344411553203 is an equidigital number, since it uses as much as digits as its factorization.
1344411553203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53141843 (or 53141837 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 1344411553203 its reverse (3023551144431), we get a palindrome (4367962697634).
The spelling of 1344411553203 in words is "one trillion, three hundred forty-four billion, four hundred eleven million, five hundred fifty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •