Base | Representation |
---|---|
bin | 1001001111101101011100… |
… | …00111000111100000010111 |
3 | 2122222121212102211102101212 |
4 | 10213312232013013200113 |
5 | 10131100342314011203 |
6 | 111123533313012035 |
7 | 4165603110534002 |
oct | 447665607074027 |
9 | 78877772742355 |
10 | 20331001313303 |
11 | 652936923891a |
12 | 234434b25401b |
13 | b46288a845c5 |
14 | 5040507b8539 |
15 | 253cc900e1d8 |
hex | 127dae1c7817 |
20331001313303 has 4 divisors (see below), whose sum is σ = 20358738014328. Its totient is φ = 20303264612280.
The previous prime is 20331001313299. The next prime is 20331001313309. The reversal of 20331001313303 is 30331310013302.
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 20331001313303 - 22 = 20331001313299 is a prime.
It is a super-2 number, since 2×203310013133032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20331001313309) 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, 13868349413 + ... + 13868350878.
It is an arithmetic number, because the mean of its divisors is an integer number (5089684503582).
Almost surely, 220331001313303 is an apocalyptic number.
20331001313303 is a deficient number, since it is larger than the sum of its proper divisors (27736701025).
20331001313303 is an equidigital number, since it uses as much as digits as its factorization.
20331001313303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27736701024.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 20331001313303 its reverse (30331310013302), we get a palindrome (50662311326605).
The spelling of 20331001313303 in words is "twenty trillion, three hundred thirty-one billion, one million, three hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •