Base | Representation |
---|---|
bin | 1100000110011… |
… | …11011100111111 |
3 | 21002000101200121 |
4 | 12003033130333 |
5 | 201441404043 |
6 | 14023435411 |
7 | 2341563223 |
oct | 603173477 |
9 | 232011617 |
10 | 101513023 |
11 | 52335267 |
12 | 29bb5b67 |
13 | 180533a1 |
14 | d6a6783 |
15 | 8da2ded |
hex | 60cf73f |
101513023 has 2 divisors, whose sum is σ = 101513024. Its totient is φ = 101513022.
The previous prime is 101513017. The next prime is 101513039. The reversal of 101513023 is 320315101.
It is an a-pointer prime, because the next prime (101513039) can be obtained adding 101513023 to its sum of digits (16).
It is a weak prime.
It is an emirp because it is prime and its reverse (320315101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101513023 - 225 = 67958591 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101512988 and 101513006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101513123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50756511 + 50756512.
It is an arithmetic number, because the mean of its divisors is an integer number (50756512).
Almost surely, 2101513023 is an apocalyptic number.
101513023 is a deficient number, since it is larger than the sum of its proper divisors (1).
101513023 is an equidigital number, since it uses as much as digits as its factorization.
101513023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 101513023 is about 10075.3671397126. The cubic root of 101513023 is about 466.4881188274.
Adding to 101513023 its reverse (320315101), we get a palindrome (421828124).
The spelling of 101513023 in words is "one hundred one million, five hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •