Base | Representation |
---|---|
bin | 10011000000011010010… |
… | …110000000001100000101 |
3 | 11121212022012012221000210 |
4 | 103000122112000030011 |
5 | 132344404140033131 |
6 | 2440004121430033 |
7 | 163235450051220 |
oct | 23003226001405 |
9 | 4555265187023 |
10 | 1306112033541 |
11 | 463a12213487 |
12 | 19117233b319 |
13 | 9622045b033 |
14 | 473051dc5b7 |
15 | 23e957dd146 |
hex | 1301a580305 |
1306112033541 has 16 divisors (see below), whose sum is σ = 2022893268608. Its totient is φ = 734114491200.
The previous prime is 1306112033531. The next prime is 1306112033573. The reversal of 1306112033541 is 1453302116031.
It is not a de Polignac number, because 1306112033541 - 26 = 1306112033477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1306112033499 and 1306112033508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1306112033531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 509800450 + ... + 509803011.
It is an arithmetic number, because the mean of its divisors is an integer number (126430829288).
Almost surely, 21306112033541 is an apocalyptic number.
It is an amenable number.
1306112033541 is a deficient number, since it is larger than the sum of its proper divisors (716781235067).
1306112033541 is a wasteful number, since it uses less digits than its factorization.
1306112033541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019603532.
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 1306112033541 its reverse (1453302116031), we get a palindrome (2759414149572).
The spelling of 1306112033541 in words is "one trillion, three hundred six billion, one hundred twelve million, thirty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •