Base | Representation |
---|---|
bin | 110001011001011111100101… |
… | …0010011011010100001000101 |
3 | 2002222110222022210112210010121 |
4 | 1202302333022103122201011 |
5 | 423423022243213141123 |
6 | 4140044115042021541 |
7 | 160344324052036363 |
oct | 14262771223324105 |
9 | 2088428283483117 |
10 | 434512350521413 |
11 | 1164a37201792aa |
12 | 408974a30478b1 |
13 | 1585b453574618 |
14 | 794271d53a633 |
15 | 35379e3e0475d |
hex | 18b2fca4da845 |
434512350521413 has 2 divisors, whose sum is σ = 434512350521414. Its totient is φ = 434512350521412.
The previous prime is 434512350521371. The next prime is 434512350521497. The reversal of 434512350521413 is 314125053215434.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 432359786187169 + 2152564334244 = 20793263^2 + 1467162^2 .
It is a cyclic number.
It is not a de Polignac number, because 434512350521413 - 213 = 434512350513221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 434512350521413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (434512350521813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 217256175260706 + 217256175260707.
It is an arithmetic number, because the mean of its divisors is an integer number (217256175260707).
Almost surely, 2434512350521413 is an apocalyptic number.
It is an amenable number.
434512350521413 is a deficient number, since it is larger than the sum of its proper divisors (1).
434512350521413 is an equidigital number, since it uses as much as digits as its factorization.
434512350521413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864000, while the sum is 43.
The spelling of 434512350521413 in words is "four hundred thirty-four trillion, five hundred twelve billion, three hundred fifty million, five hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •