Base | Representation |
---|---|
bin | 101111110000011001101100… |
… | …101111100010100000011011 |
3 | 1000112200002021112210112110121 |
4 | 233300121230233202200123 |
5 | 210012200234132013202 |
6 | 2022412233214254111 |
7 | 62145323061416623 |
oct | 5760315457424033 |
9 | 1015602245715417 |
10 | 210034315110427 |
11 | 60a18064329765 |
12 | 1b6820831b7337 |
13 | 90271c678c672 |
14 | 39c1a022d9883 |
15 | 194371b877537 |
hex | bf066cbe281b |
210034315110427 has 2 divisors, whose sum is σ = 210034315110428. Its totient is φ = 210034315110426.
The previous prime is 210034315110397. The next prime is 210034315110491. The reversal of 210034315110427 is 724011513430012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210034315110427 - 231 = 210032167626779 is a prime.
It is a super-2 number, since 2×2100343151104272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210034315110392 and 210034315110401.
It is not a weakly prime, because it can be changed into another prime (210034315110497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105017157555213 + 105017157555214.
It is an arithmetic number, because the mean of its divisors is an integer number (105017157555214).
Almost surely, 2210034315110427 is an apocalyptic number.
210034315110427 is a deficient number, since it is larger than the sum of its proper divisors (1).
210034315110427 is an equidigital number, since it uses as much as digits as its factorization.
210034315110427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 34.
Adding to 210034315110427 its reverse (724011513430012), we get a palindrome (934045828540439).
The spelling of 210034315110427 in words is "two hundred ten trillion, thirty-four billion, three hundred fifteen million, one hundred ten thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.579 sec. • engine limits •