Base | Representation |
---|---|
bin | 10111100001001010110011… |
… | …111000000000000011111011 |
3 | 111120020020022120212201212001 |
4 | 113201022303320000003323 |
5 | 102024132143034134001 |
6 | 1003553041111201431 |
7 | 30533614233316354 |
oct | 2741126370000373 |
9 | 446206276781761 |
10 | 103434420224251 |
11 | 2aa59322761176 |
12 | b72634a076277 |
13 | 4593a9337077c |
14 | 1b783773b6d2b |
15 | be5877617001 |
hex | 5e12b3e000fb |
103434420224251 has 2 divisors, whose sum is σ = 103434420224252. Its totient is φ = 103434420224250.
The previous prime is 103434420224173. The next prime is 103434420224281. The reversal of 103434420224251 is 152422024434301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103434420224251 - 27 = 103434420224123 is a prime.
It is a super-2 number, since 2×1034344202242512 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103434420224251.
It is not a weakly prime, because it can be changed into another prime (103434420224281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51717210112125 + 51717210112126.
It is an arithmetic number, because the mean of its divisors is an integer number (51717210112126).
Almost surely, 2103434420224251 is an apocalyptic number.
103434420224251 is a deficient number, since it is larger than the sum of its proper divisors (1).
103434420224251 is an equidigital number, since it uses as much as digits as its factorization.
103434420224251 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 184320, while the sum is 37.
Adding to 103434420224251 its reverse (152422024434301), we get a palindrome (255856444658552).
The spelling of 103434420224251 in words is "one hundred three trillion, four hundred thirty-four billion, four hundred twenty million, two hundred twenty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •