Base | Representation |
---|---|
bin | 101101100101000110001011… |
… | …010101100111100010100101 |
3 | 222021202220202220002200020112 |
4 | 231211012023111213202211 |
5 | 202233324314123244323 |
6 | 1550202400545542405 |
7 | 60136566015235316 |
oct | 5545061325474245 |
9 | 867686686080215 |
10 | 200461346306213 |
11 | 589671a7a78573 |
12 | 1a596903344a05 |
13 | 87b15682563a5 |
14 | 37705493b260d |
15 | 18296d64c6178 |
hex | b6518b5678a5 |
200461346306213 has 2 divisors, whose sum is σ = 200461346306214. Its totient is φ = 200461346306212.
The previous prime is 200461346306183. The next prime is 200461346306233. The reversal of 200461346306213 is 312603643164002.
200461346306213 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 can be written as a sum of positive squares in only one way, i.e., 124530913872964 + 75930432433249 = 11159342^2 + 8713807^2 .
It is a cyclic number.
It is not a de Polignac number, because 200461346306213 - 210 = 200461346305189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200461346306233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100230673153106 + 100230673153107.
It is an arithmetic number, because the mean of its divisors is an integer number (100230673153107).
Almost surely, 2200461346306213 is an apocalyptic number.
It is an amenable number.
200461346306213 is a deficient number, since it is larger than the sum of its proper divisors (1).
200461346306213 is an equidigital number, since it uses as much as digits as its factorization.
200461346306213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 373248, while the sum is 41.
The spelling of 200461346306213 in words is "two hundred trillion, four hundred sixty-one billion, three hundred forty-six million, three hundred six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •