Base | Representation |
---|---|
bin | 11110000001010100110… |
… | …11100000000000111011 |
3 | 10122121111021202121021211 |
4 | 33000222123200000323 |
5 | 113400010011100011 |
6 | 2105511050343551 |
7 | 134344426234450 |
oct | 17005233400073 |
9 | 3577437677254 |
10 | 1031504003131 |
11 | 368505133818 |
12 | 147ab472abb7 |
13 | 76369125004 |
14 | 37cd4517827 |
15 | 1bc7242ab21 |
hex | f02a6e003b |
1031504003131 has 4 divisors (see below), whose sum is σ = 1178861717872. Its totient is φ = 884146288392.
The previous prime is 1031504003099. The next prime is 1031504003137. The reversal of 1031504003131 is 1313004051301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1031504003131 - 25 = 1031504003099 is a prime.
It is a super-2 number, since 2×10315040031312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031504003137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73678857360 + ... + 73678857373.
It is an arithmetic number, because the mean of its divisors is an integer number (294715429468).
Almost surely, 21031504003131 is an apocalyptic number.
1031504003131 is a deficient number, since it is larger than the sum of its proper divisors (147357714741).
1031504003131 is an equidigital number, since it uses as much as digits as its factorization.
1031504003131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147357714740.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 1031504003131 its reverse (1313004051301), we get a palindrome (2344508054432).
The spelling of 1031504003131 in words is "one trillion, thirty-one billion, five hundred four million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •