Base | Representation |
---|---|
bin | 10010111010111011110… |
… | …111111010111100010101 |
3 | 11121022010102010110221012 |
4 | 102322323313322330111 |
5 | 132300333410402013 |
6 | 2433152434502005 |
7 | 162636651453320 |
oct | 22727367727425 |
9 | 4538112113835 |
10 | 1300232122133 |
11 | 461475154a6a |
12 | 18bbb1134905 |
13 | 957c421a609 |
14 | 46d0832d7b7 |
15 | 23c4e4c71a8 |
hex | 12ebbdfaf15 |
1300232122133 has 8 divisors (see below), whose sum is σ = 1486603162368. Its totient is φ = 1114016980464.
The previous prime is 1300232122127. The next prime is 1300232122171. The reversal of 1300232122133 is 3312212320031.
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 1300232122133 - 24 = 1300232122117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1300232122099 and 1300232122108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300232124133) 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, 38956766 + ... + 38990127.
It is an arithmetic number, because the mean of its divisors is an integer number (185825395296).
Almost surely, 21300232122133 is an apocalyptic number.
It is an amenable number.
1300232122133 is a deficient number, since it is larger than the sum of its proper divisors (186371040235).
1300232122133 is an equidigital number, since it uses as much as digits as its factorization.
1300232122133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77949283.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1300232122133 its reverse (3312212320031), we get a palindrome (4612444442164).
The spelling of 1300232122133 in words is "one trillion, three hundred billion, two hundred thirty-two million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •