Base | Representation |
---|---|
bin | 101111110001011000101111… |
… | …110011000110110010010111 |
3 | 1000112220120000110122112110000 |
4 | 233301120233303012302113 |
5 | 210014302410100041043 |
6 | 2022503310520102343 |
7 | 62153240502426333 |
oct | 5761305763066227 |
9 | 1015816013575400 |
10 | 210102012112023 |
11 | 60a43843541a69 |
12 | 1b6932169049b3 |
13 | 90306c4a52165 |
14 | 39c4dc51027c3 |
15 | 194537ebc32d3 |
hex | bf162fcc6c97 |
210102012112023 has 10 divisors (see below), whose sum is σ = 313856092167464. Its totient is φ = 140068008074628.
The previous prime is 210102012112019. The next prime is 210102012112039. The reversal of 210102012112023 is 320211210201012.
210102012112023 is a `hidden beast` number, since 210 + 1 + 0 + 201 + 211 + 20 + 23 = 666.
It is not a de Polignac number, because 210102012112023 - 22 = 210102012112019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210102012111987 and 210102012112005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210102012112123) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1296926000611 + ... + 1296926000772.
Almost surely, 2210102012112023 is an apocalyptic number.
210102012112023 is a deficient number, since it is larger than the sum of its proper divisors (103754080055441).
210102012112023 is an equidigital number, since it uses as much as digits as its factorization.
210102012112023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2593852001395 (or 2593852001386 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 210102012112023 its reverse (320211210201012), we get a palindrome (530313222313035).
The spelling of 210102012112023 in words is "two hundred ten trillion, one hundred two billion, twelve million, one hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •