Base | Representation |
---|---|
bin | 1011111100111011010110… |
… | …1000011011100000101011 |
3 | 1201112022010102122221222111 |
4 | 2333032311220123200223 |
5 | 3210301442132424003 |
6 | 43541015345303151 |
7 | 2524300646636101 |
oct | 277166550334053 |
9 | 51468112587874 |
10 | 13141352233003 |
11 | 4207241817575 |
12 | 1582a70334ab7 |
13 | 7442bb742c87 |
14 | 33608b08dc71 |
15 | 17bc83e64e6d |
hex | bf3b5a1b82b |
13141352233003 has 4 divisors (see below), whose sum is σ = 13168116698328. Its totient is φ = 13114587767680.
The previous prime is 13141352232889. The next prime is 13141352233019. The reversal of 13141352233003 is 30033225314131.
It is a happy number.
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 13141352233003 - 229 = 13140815362091 is a prime.
It is a super-3 number, since 3×131413522330033 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13141352233063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13382231926 + ... + 13382232907.
It is an arithmetic number, because the mean of its divisors is an integer number (3292029174582).
Almost surely, 213141352233003 is an apocalyptic number.
13141352233003 is a deficient number, since it is larger than the sum of its proper divisors (26764465325).
13141352233003 is an equidigital number, since it uses as much as digits as its factorization.
13141352233003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26764465324.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 13141352233003 its reverse (30033225314131), we get a palindrome (43174577547134).
The spelling of 13141352233003 in words is "thirteen trillion, one hundred forty-one billion, three hundred fifty-two million, two hundred thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •