Base | Representation |
---|---|
bin | 101000010000000001001101… |
… | …1000010000001000010001001 |
3 | 1201102120101220211200101021002 |
4 | 1100200002123002001002021 |
5 | 332401134331324001443 |
6 | 3252554104115224345 |
7 | 134400634462441241 |
oct | 12040023302010211 |
9 | 1642511824611232 |
10 | 354045345140873 |
11 | a289a873430711 |
12 | 338604398a80b5 |
13 | 122724431a8c09 |
14 | 635dc597b2b21 |
15 | 2ade7ea3412b8 |
hex | 142009b081089 |
354045345140873 has 2 divisors, whose sum is σ = 354045345140874. Its totient is φ = 354045345140872.
The previous prime is 354045345140863. The next prime is 354045345140899. The reversal of 354045345140873 is 378041543540453.
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., 276188934058489 + 77856411082384 = 16618933^2 + 8823628^2 .
It is a cyclic number.
It is not a de Polignac number, because 354045345140873 - 238 = 353770467233929 is a prime.
It is not a weakly prime, because it can be changed into another prime (354045345140863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 177022672570436 + 177022672570437.
It is an arithmetic number, because the mean of its divisors is an integer number (177022672570437).
Almost surely, 2354045345140873 is an apocalyptic number.
It is an amenable number.
354045345140873 is a deficient number, since it is larger than the sum of its proper divisors (1).
354045345140873 is an equidigital number, since it uses as much as digits as its factorization.
354045345140873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384000, while the sum is 56.
The spelling of 354045345140873 in words is "three hundred fifty-four trillion, forty-five billion, three hundred forty-five million, one hundred forty thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •