Base | Representation |
---|---|
bin | 10010111110110110101… |
… | …101001110110010001001 |
3 | 11121200222200202012022200 |
4 | 102332312231032302021 |
5 | 132332443220313113 |
6 | 2435130204510413 |
7 | 163146151315110 |
oct | 22766655166211 |
9 | 4550880665280 |
10 | 1304440401033 |
11 | 463234666210 |
12 | 19098654b409 |
13 | 96015034683 |
14 | 471c71bcc77 |
15 | 23de8b8e873 |
hex | 12fb6b4ec89 |
1304440401033 has 24 divisors (see below), whose sum is σ = 2349122108736. Its totient is φ = 677631376800.
The previous prime is 1304440401029. The next prime is 1304440401101. The reversal of 1304440401033 is 3301040444031.
It is not a de Polignac number, because 1304440401033 - 22 = 1304440401029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1304440400988 and 1304440401006.
It is not an unprimeable number, because it can be changed into a prime (1304440401233) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 941153998 + ... + 941155383.
It is an arithmetic number, because the mean of its divisors is an integer number (97880087864).
Almost surely, 21304440401033 is an apocalyptic number.
It is an amenable number.
1304440401033 is a deficient number, since it is larger than the sum of its proper divisors (1044681707703).
1304440401033 is a wasteful number, since it uses less digits than its factorization.
1304440401033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1882309405 (or 1882309402 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 1304440401033 its reverse (3301040444031), we get a palindrome (4605480845064).
The spelling of 1304440401033 in words is "one trillion, three hundred four billion, four hundred forty million, four hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •