Base | Representation |
---|---|
bin | 10010111110110100011… |
… | …100101111110001000101 |
3 | 11121200220001110220112000 |
4 | 102332310130233301011 |
5 | 132332404021302003 |
6 | 2435122333015513 |
7 | 163145211345102 |
oct | 22766434576105 |
9 | 4550801426460 |
10 | 1304402525253 |
11 | 463215246613 |
12 | 190975924599 |
13 | 9600a232979 |
14 | 471c215daa9 |
15 | 23de56ac1a3 |
hex | 12fb472fc45 |
1304402525253 has 128 divisors (see below), whose sum is σ = 2199513139200. Its totient is φ = 758988112896.
The previous prime is 1304402525201. The next prime is 1304402525297. The reversal of 1304402525253 is 3525252044031.
1304402525253 is a `hidden beast` number, since 1 + 304 + 4 + 0 + 252 + 52 + 53 = 666.
It is not a de Polignac number, because 1304402525253 - 29 = 1304402524741 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304402535253) 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 127 ways as a sum of consecutive naturals, for example, 215850450 + ... + 215856492.
It is an arithmetic number, because the mean of its divisors is an integer number (17183696400).
Almost surely, 21304402525253 is an apocalyptic number.
It is an amenable number.
1304402525253 is a deficient number, since it is larger than the sum of its proper divisors (895110613947).
1304402525253 is a wasteful number, since it uses less digits than its factorization.
1304402525253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6608 (or 6602 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 36.
Adding to 1304402525253 its reverse (3525252044031), we get a palindrome (4829654569284).
The spelling of 1304402525253 in words is "one trillion, three hundred four billion, four hundred two million, five hundred twenty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •