Base | Representation |
---|---|
bin | 1100000010000111111010… |
… | …0001100111101110000111 |
3 | 1201211211112210111201102021 |
4 | 3000201332201213232013 |
5 | 3213232303213424333 |
6 | 44050021442424011 |
7 | 2533611101362216 |
oct | 300417641475607 |
9 | 51754483451367 |
10 | 13230622014343 |
11 | 4241091229568 |
12 | 1598224662007 |
13 | 74c8471a54b6 |
14 | 33a518dc907d |
15 | 17e25b15082d |
hex | c087e867b87 |
13230622014343 has 2 divisors, whose sum is σ = 13230622014344. Its totient is φ = 13230622014342.
The previous prime is 13230622014299. The next prime is 13230622014371. The reversal of 13230622014343 is 34341022603231.
13230622014343 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13230622014343 - 29 = 13230622013831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13230622014299 and 13230622014308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13230622014373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6615311007171 + 6615311007172.
It is an arithmetic number, because the mean of its divisors is an integer number (6615311007172).
Almost surely, 213230622014343 is an apocalyptic number.
13230622014343 is a deficient number, since it is larger than the sum of its proper divisors (1).
13230622014343 is an equidigital number, since it uses as much as digits as its factorization.
13230622014343 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 34.
Adding to 13230622014343 its reverse (34341022603231), we get a palindrome (47571644617574).
The spelling of 13230622014343 in words is "thirteen trillion, two hundred thirty billion, six hundred twenty-two million, fourteen thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •