Base | Representation |
---|---|
bin | 10011011000000100011… |
… | …011111101011101001001 |
3 | 11201021212112001210000002 |
4 | 103120010123331131021 |
5 | 133303420130101413 |
6 | 2455404512252345 |
7 | 165125110544615 |
oct | 23300433753511 |
9 | 4637775053002 |
10 | 1331514300233 |
11 | 473768123417 |
12 | 1960815410b5 |
13 | 9873b11a780 |
14 | 48634b7a345 |
15 | 24980970958 |
hex | 136046fd749 |
1331514300233 has 32 divisors (see below), whose sum is σ = 1478980339200. Its totient is φ = 1191092484096.
The previous prime is 1331514300227. The next prime is 1331514300307. The reversal of 1331514300233 is 3320034151331.
It is a cyclic number.
It is not a de Polignac number, because 1331514300233 - 210 = 1331514299209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1331514300196 and 1331514300205.
It is not an unprimeable number, because it can be changed into a prime (1331514300433) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 135325328 + ... + 135335166.
It is an arithmetic number, because the mean of its divisors is an integer number (46218135600).
Almost surely, 21331514300233 is an apocalyptic number.
1331514300233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1331514300233 is a deficient number, since it is larger than the sum of its proper divisors (147466038967).
1331514300233 is a wasteful number, since it uses less digits than its factorization.
1331514300233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12401.
The product of its (nonzero) digits is 9720, while the sum is 29.
Adding to 1331514300233 its reverse (3320034151331), we get a palindrome (4651548451564).
The spelling of 1331514300233 in words is "one trillion, three hundred thirty-one billion, five hundred fourteen million, three hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •