Base | Representation |
---|---|
bin | 101110001101001001001010… |
… | …011010111010110000000001 |
3 | 222122112000010110012211020011 |
4 | 232031021022122322300001 |
5 | 203113421400242311223 |
6 | 2000110525433144521 |
7 | 60542451534054001 |
oct | 5615111232726001 |
9 | 878460113184204 |
10 | 203213331213313 |
11 | 59828320789093 |
12 | 1a96013155b141 |
13 | 8950c1ccb8a45 |
14 | 3827813344001 |
15 | 18760a22d180d |
hex | b8d24a6bac01 |
203213331213313 has 6 divisors (see below), whose sum is σ = 215870216894726. Its totient is φ = 191259605847552.
The previous prime is 203213331213259. The next prime is 203213331213331. The reversal of 203213331213313 is 313312133312302.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 70622896410049 + 132590434803264 = 8403743^2 + 11514792^2 .
It is not a de Polignac number, because 203213331213313 - 229 = 203212794342401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203213331213353) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 351580157520 + ... + 351580158097.
Almost surely, 2203213331213313 is an apocalyptic number.
It is an amenable number.
203213331213313 is a deficient number, since it is larger than the sum of its proper divisors (12656885681413).
203213331213313 is an equidigital number, since it uses as much as digits as its factorization.
203213331213313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703160315651 (or 703160315634 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 31.
Adding to 203213331213313 its reverse (313312133312302), we get a palindrome (516525464525615).
The spelling of 203213331213313 in words is "two hundred three trillion, two hundred thirteen billion, three hundred thirty-one million, two hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.238 sec. • engine limits •