Base | Representation |
---|---|
bin | 11110011010101101010… |
… | …10011011000110000011 |
3 | 10200220122222101111200202 |
4 | 33031112222123012003 |
5 | 114110412014431111 |
6 | 2120043200435415 |
7 | 135336215021612 |
oct | 17152652330603 |
9 | 3626588344622 |
10 | 1045131014531 |
11 | 37326823610a |
12 | 14a678318b6b |
13 | 7772b38c176 |
14 | 3882825b879 |
15 | 1c2bd933b3b |
hex | f356a9b183 |
1045131014531 has 8 divisors (see below), whose sum is σ = 1046118572304. Its totient is φ = 1044143654400.
The previous prime is 1045131014489. The next prime is 1045131014537. The reversal of 1045131014531 is 1354101315401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1045131014531 - 26 = 1045131014467 is a prime.
It is a super-2 number, since 2×10451310145312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1045131014494 and 1045131014503.
It is not an unprimeable number, because it can be changed into a prime (1045131014537) 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, 11873675 + ... + 11961371.
It is an arithmetic number, because the mean of its divisors is an integer number (130764821538).
Almost surely, 21045131014531 is an apocalyptic number.
1045131014531 is a deficient number, since it is larger than the sum of its proper divisors (987557773).
1045131014531 is an equidigital number, since it uses as much as digits as its factorization.
1045131014531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98821.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 1045131014531 its reverse (1354101315401), we get a palindrome (2399232329932).
The spelling of 1045131014531 in words is "one trillion, forty-five billion, one hundred thirty-one million, fourteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •