Base | Representation |
---|---|
bin | 100110110111011… |
… | …1100101111000111 |
3 | 10100212222211122010 |
4 | 1031232330233013 |
5 | 10132330344111 |
6 | 333224305303 |
7 | 44214055266 |
oct | 11556745707 |
9 | 3325884563 |
10 | 1304153031 |
11 | 60a184525 |
12 | 304912233 |
13 | 17a2603ac |
14 | c52c25dd |
15 | 79760aa6 |
hex | 4dbbcbc7 |
1304153031 has 8 divisors (see below), whose sum is σ = 1740843520. Its totient is φ = 868448952.
The previous prime is 1304153029. The next prime is 1304153087. The reversal of 1304153031 is 1303514031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1304153031 - 21 = 1304153029 is a prime.
It is a super-2 number, since 2×13041530312 = 3401630256532973922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1304152989 and 1304153007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304153531) 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, 243511 + ... + 248808.
It is an arithmetic number, because the mean of its divisors is an integer number (217605440).
Almost surely, 21304153031 is an apocalyptic number.
1304153031 is a deficient number, since it is larger than the sum of its proper divisors (436690489).
1304153031 is an equidigital number, since it uses as much as digits as its factorization.
1304153031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493205.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 1304153031 is about 36113.0590091728. The cubic root of 1304153031 is about 1092.5538498209.
Adding to 1304153031 its reverse (1303514031), we get a palindrome (2607667062).
The spelling of 1304153031 in words is "one billion, three hundred four million, one hundred fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •