Base | Representation |
---|---|
bin | 10010111110011111100… |
… | …001101101001110011111 |
3 | 11121122222120222011221000 |
4 | 102332133201231032133 |
5 | 132331144141112111 |
6 | 2435023433241343 |
7 | 163133416615443 |
oct | 22763741551637 |
9 | 4548876864830 |
10 | 1304051504031 |
11 | 463055094131 |
12 | 190898263253 |
13 | 95c825ac9c3 |
14 | 4718b6a8823 |
15 | 23dc4970c56 |
hex | 12f9f86d39f |
1304051504031 has 16 divisors (see below), whose sum is σ = 1931946652000. Its totient is φ = 869359345344.
The previous prime is 1304051503969. The next prime is 1304051504039.
It is a happy number.
1304051504031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1304051504031 - 29 = 1304051503519 is a prime.
It is a super-2 number, since 2×13040515040312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1304051503986 and 1304051504004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304051504039) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4150875 + ... + 4453971.
It is an arithmetic number, because the mean of its divisors is an integer number (120746665750).
Almost surely, 21304051504031 is an apocalyptic number.
1304051504031 is a deficient number, since it is larger than the sum of its proper divisors (627895147969).
1304051504031 is a wasteful number, since it uses less digits than its factorization.
1304051504031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 462455 (or 462449 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 1304051504031 in words is "one trillion, three hundred four billion, fifty-one million, five hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •