Base | Representation |
---|---|
bin | 1001001001010001110110… |
… | …11100001000011010101001 |
3 | 2122012111111212001110022122 |
4 | 10210220323130020122221 |
5 | 10113440322213010441 |
6 | 110434231103001025 |
7 | 4143621251356514 |
oct | 444507334103251 |
9 | 78174455043278 |
10 | 20110034110121 |
11 | 6453687a9562a |
12 | 2309561899175 |
13 | b2b4a2894637 |
14 | 4d748bb9dd7b |
15 | 24d194e6a34b |
hex | 124a3b7086a9 |
20110034110121 has 8 divisors (see below), whose sum is σ = 20364674217600. Its totient is φ = 19855396070640.
The previous prime is 20110034110039. The next prime is 20110034110147. The reversal of 20110034110121 is 12101143001102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20110034110121 - 218 = 20110033847977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20110034110121.
It is not an unprimeable number, because it can be changed into a prime (20110034110181) 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, 31625606 + ... + 32255216.
It is an arithmetic number, because the mean of its divisors is an integer number (2545584277200).
Almost surely, 220110034110121 is an apocalyptic number.
It is an amenable number.
20110034110121 is a deficient number, since it is larger than the sum of its proper divisors (254640107479).
20110034110121 is an equidigital number, since it uses as much as digits as its factorization.
20110034110121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1033999.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 20110034110121 its reverse (12101143001102), we get a palindrome (32211177111223).
The spelling of 20110034110121 in words is "twenty trillion, one hundred ten billion, thirty-four million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •