Base | Representation |
---|---|
bin | 1000110000100110001101… |
… | …01101101010001010011101 |
3 | 2112012102111121120100121222 |
4 | 10120103012231222022131 |
5 | 10011042002101310323 |
6 | 104544454154103125 |
7 | 4025426334603014 |
oct | 430230655521235 |
9 | 75172447510558 |
10 | 19261967213213 |
11 | 6156a5537384a |
12 | 21b1121a1aaa5 |
13 | a9951b4cc33a |
14 | 4a83d9b4ba7b |
15 | 2360abd7e9c8 |
hex | 1184c6b6a29d |
19261967213213 has 2 divisors, whose sum is σ = 19261967213214. Its totient is φ = 19261967213212.
The previous prime is 19261967213207. The next prime is 19261967213219. The reversal of 19261967213213 is 31231276916291.
It is a balanced prime because it is at equal distance from previous prime (19261967213207) and next prime (19261967213219).
It can be written as a sum of positive squares in only one way, i.e., 13013782081444 + 6248185131769 = 3607462^2 + 2499637^2 .
It is an emirp because it is prime and its reverse (31231276916291) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 19261967213213 - 224 = 19261950435997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19261967213219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9630983606606 + 9630983606607.
It is an arithmetic number, because the mean of its divisors is an integer number (9630983606607).
Almost surely, 219261967213213 is an apocalyptic number.
It is an amenable number.
19261967213213 is a deficient number, since it is larger than the sum of its proper divisors (1).
19261967213213 is an equidigital number, since it uses as much as digits as its factorization.
19261967213213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1469664, while the sum is 53.
The spelling of 19261967213213 in words is "nineteen trillion, two hundred sixty-one billion, nine hundred sixty-seven million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •