Base | Representation |
---|---|
bin | 1011111100011101000100… |
… | …0111000011101110111001 |
3 | 1201111112010220200000010211 |
4 | 2333013101013003232321 |
5 | 3210133320131443223 |
6 | 43533153002311121 |
7 | 2523562342151626 |
oct | 277072107035671 |
9 | 51445126600124 |
10 | 13133223312313 |
11 | 42038501a50a5 |
12 | 1581381ab84a1 |
13 | 7435c45a1730 |
14 | 33591962734d |
15 | 17b95a4a0d0d |
hex | bf1d11c3bb9 |
13133223312313 has 32 divisors (see below), whose sum is σ = 14812667331840. Its totient is φ = 11575214386560.
The previous prime is 13133223312263. The next prime is 13133223312373. The reversal of 13133223312313 is 31321332233131.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-13133223312313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13133223312373) 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, 88976533 + ... + 89124013.
It is an arithmetic number, because the mean of its divisors is an integer number (462895854120).
Almost surely, 213133223312313 is an apocalyptic number.
13133223312313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13133223312313 is a deficient number, since it is larger than the sum of its proper divisors (1679444019527).
13133223312313 is an equidigital number, since it uses as much as digits as its factorization.
13133223312313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148126 (or 148080 counting only the distinct ones).
The product of its digits is 17496, while the sum is 31.
Adding to 13133223312313 its reverse (31321332233131), we get a palindrome (44454555545444).
The spelling of 13133223312313 in words is "thirteen trillion, one hundred thirty-three billion, two hundred twenty-three million, three hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •