Base | Representation |
---|---|
bin | 1100000001000111011011… |
… | …0001001111100101110111 |
3 | 1201210011212102201001012012 |
4 | 3000101312301033211313 |
5 | 3212441330334213103 |
6 | 44034040045314435 |
7 | 2532426122025656 |
oct | 300216661174567 |
9 | 51704772631165 |
10 | 13213312022903 |
11 | 4234809191813 |
12 | 15949b3565a1b |
13 | 74b018bc6605 |
14 | 33975609519d |
15 | 17da966442d8 |
hex | c0476c4f977 |
13213312022903 has 2 divisors, whose sum is σ = 13213312022904. Its totient is φ = 13213312022902.
The previous prime is 13213312022893. The next prime is 13213312022947. The reversal of 13213312022903 is 30922021331231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13213312022903 - 222 = 13213307828599 is a prime.
It is a super-2 number, since 2×132133120229032 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13213312022903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13213312022003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6606656011451 + 6606656011452.
It is an arithmetic number, because the mean of its divisors is an integer number (6606656011452).
Almost surely, 213213312022903 is an apocalyptic number.
13213312022903 is a deficient number, since it is larger than the sum of its proper divisors (1).
13213312022903 is an equidigital number, since it uses as much as digits as its factorization.
13213312022903 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 13213312022903 in words is "thirteen trillion, two hundred thirteen billion, three hundred twelve million, twenty-two thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •