Base | Representation |
---|---|
bin | 11001000101000101000110… |
… | …000001110010000101111111 |
3 | 112110112121011200021001221121 |
4 | 121011011012001302011333 |
5 | 103424124332340013043 |
6 | 1030331120502411411 |
7 | 32142633344441146 |
oct | 3105050601620577 |
9 | 473477150231847 |
10 | 110300230001023 |
11 | 32166079350687 |
12 | 10454b0ba30b67 |
13 | 497136195c93a |
14 | 1d347b983475d |
15 | cb42671a4ded |
hex | 64514607217f |
110300230001023 has 2 divisors, whose sum is σ = 110300230001024. Its totient is φ = 110300230001022.
The previous prime is 110300230000937. The next prime is 110300230001041. The reversal of 110300230001023 is 320100032003011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110300230001023 - 213 = 110300229992831 is a prime.
It is a super-2 number, since 2×1103002300010232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110300230000988 and 110300230001006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110300230005023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55150115000511 + 55150115000512.
It is an arithmetic number, because the mean of its divisors is an integer number (55150115000512).
Almost surely, 2110300230001023 is an apocalyptic number.
110300230001023 is a deficient number, since it is larger than the sum of its proper divisors (1).
110300230001023 is an equidigital number, since it uses as much as digits as its factorization.
110300230001023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 110300230001023 its reverse (320100032003011), we get a palindrome (430400262004034).
The spelling of 110300230001023 in words is "one hundred ten trillion, three hundred billion, two hundred thirty million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •