Base | Representation |
---|---|
bin | 11001000011110001001011… |
… | …000011011100100100011011 |
3 | 112110012222120202102020112002 |
4 | 121003301023003130210123 |
5 | 103421140311210310021 |
6 | 1030221455152511215 |
7 | 32133263341241120 |
oct | 3103611303344433 |
9 | 473188522366462 |
10 | 110210120010011 |
11 | 3213093863472a |
12 | 1043b56224b50b |
13 | 4965a01109428 |
14 | 1d302ac0a4747 |
15 | cb1c4134d50b |
hex | 643c4b0dc91b |
110210120010011 has 8 divisors (see below), whose sum is σ = 133363506566880. Its totient is φ = 88909004377728.
The previous prime is 110210120009999. The next prime is 110210120010013. The reversal of 110210120010011 is 110010021012011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110210120010011 - 234 = 110192940140827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110210120009974 and 110210120010001.
It is not an unprimeable number, because it can be changed into a prime (110210120010013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 463067731016 + ... + 463067731253.
It is an arithmetic number, because the mean of its divisors is an integer number (16670438320860).
Almost surely, 2110210120010011 is an apocalyptic number.
110210120010011 is a deficient number, since it is larger than the sum of its proper divisors (23153386556869).
110210120010011 is an equidigital number, since it uses as much as digits as its factorization.
110210120010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 926135462293.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110210120010011 its reverse (110010021012011), we get a palindrome (220220141022022).
The spelling of 110210120010011 in words is "one hundred ten trillion, two hundred ten billion, one hundred twenty million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •