Base | Representation |
---|---|
bin | 11000011001101010… |
… | …11000101011110111 |
3 | 1020210222101021212201 |
4 | 30030311120223313 |
5 | 203312124120343 |
6 | 10003531125331 |
7 | 642431026423 |
oct | 141465305367 |
9 | 36728337781 |
10 | 13100223223 |
11 | 561280966a |
12 | 26572a3847 |
13 | 130a092c99 |
14 | 8c3bb7b83 |
15 | 51a14c94d |
hex | 30cd58af7 |
13100223223 has 2 divisors, whose sum is σ = 13100223224. Its totient is φ = 13100223222.
The previous prime is 13100223221. The next prime is 13100223271. The reversal of 13100223223 is 32232200131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13100223223 - 21 = 13100223221 is a prime.
Together with 13100223221, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 13100223223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13100223221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550111611 + 6550111612.
It is an arithmetic number, because the mean of its divisors is an integer number (6550111612).
Almost surely, 213100223223 is an apocalyptic number.
13100223223 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100223223 is an equidigital number, since it uses as much as digits as its factorization.
13100223223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 13100223223 its reverse (32232200131), we get a palindrome (45332423354).
The spelling of 13100223223 in words is "thirteen billion, one hundred million, two hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •