Base | Representation |
---|---|
bin | 110001000001100010100100… |
… | …0101001011010001010110101 |
3 | 2002112211020210021112201112101 |
4 | 1202003011020221122022311 |
5 | 423010103012424102331 |
6 | 4125043501120222101 |
7 | 156554430204625216 |
oct | 14203051051321265 |
9 | 2075736707481471 |
10 | 431220230300341 |
11 | 115444522130919 |
12 | 4044545276a931 |
13 | 1567cb7c585501 |
14 | 786b255c3340d |
15 | 34cc063ba1061 |
hex | 1883148a5a2b5 |
431220230300341 has 2 divisors, whose sum is σ = 431220230300342. Its totient is φ = 431220230300340.
The previous prime is 431220230300311. The next prime is 431220230300381. The reversal of 431220230300341 is 143003032022134.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 362621186038225 + 68599044262116 = 19042615^2 + 8282454^2 .
It is a cyclic number.
It is not a de Polignac number, because 431220230300341 - 29 = 431220230299829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (431220230300311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 215610115150170 + 215610115150171.
It is an arithmetic number, because the mean of its divisors is an integer number (215610115150171).
Almost surely, 2431220230300341 is an apocalyptic number.
It is an amenable number.
431220230300341 is a deficient number, since it is larger than the sum of its proper divisors (1).
431220230300341 is an equidigital number, since it uses as much as digits as its factorization.
431220230300341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 431220230300341 its reverse (143003032022134), we get a palindrome (574223262322475).
The spelling of 431220230300341 in words is "four hundred thirty-one trillion, two hundred twenty billion, two hundred thirty million, three hundred thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •