Base | Representation |
---|---|
bin | 1001001100011111011110… |
… | …1010101110011010110111 |
3 | 1022210112020010211221002100 |
4 | 2103013313222232122313 |
5 | 2311121204041020043 |
6 | 33300322352513143 |
7 | 2062303336302420 |
oct | 223076752563267 |
9 | 38715203757070 |
10 | 10110213220023 |
11 | 3248798876524 |
12 | 1173515b4b7b3 |
13 | 58450988ab07 |
14 | 26d4a0776647 |
15 | 127ecab06cd3 |
hex | 931f7aae6b7 |
10110213220023 has 48 divisors (see below), whose sum is σ = 16729575782400. Its totient is φ = 5763536093952.
The previous prime is 10110213220007. The next prime is 10110213220027. The reversal of 10110213220023 is 32002231201101.
It is not a de Polignac number, because 10110213220023 - 24 = 10110213220007 is a prime.
It is a super-2 number, since 2×101102132200232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110213219978 and 10110213220005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110213220027) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 53605615 + ... + 53793887.
It is an arithmetic number, because the mean of its divisors is an integer number (348532828800).
Almost surely, 210110213220023 is an apocalyptic number.
10110213220023 is a deficient number, since it is larger than the sum of its proper divisors (6619362562377).
10110213220023 is a wasteful number, since it uses less digits than its factorization.
10110213220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190308 (or 190305 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10110213220023 its reverse (32002231201101), we get a palindrome (42112444421124).
The spelling of 10110213220023 in words is "ten trillion, one hundred ten billion, two hundred thirteen million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •