Base | Representation |
---|---|
bin | 11001000010100111100000… |
… | …111110111001010111001001 |
3 | 112102221102102220112022122220 |
4 | 121002213200332321113021 |
5 | 103413341322420133001 |
6 | 1030121255221204253 |
7 | 32124463421025204 |
oct | 3102474076712711 |
9 | 472842386468586 |
10 | 110131031021001 |
11 | 321003429a06a1 |
12 | 1042816b560689 |
13 | 495b408954a93 |
14 | 1d2a52831093b |
15 | caeb62d33c36 |
hex | 6429e0fb95c9 |
110131031021001 has 4 divisors (see below), whose sum is σ = 146841374694672. Its totient is φ = 73420687347332.
The previous prime is 110131031020979. The next prime is 110131031021017. The reversal of 110131031021001 is 100120130131011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110131031021001 - 27 = 110131031020873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110131031021051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18355171836831 + ... + 18355171836836.
It is an arithmetic number, because the mean of its divisors is an integer number (36710343673668).
Almost surely, 2110131031021001 is an apocalyptic number.
It is an amenable number.
110131031021001 is a deficient number, since it is larger than the sum of its proper divisors (36710343673671).
110131031021001 is an equidigital number, since it uses as much as digits as its factorization.
110131031021001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36710343673670.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 110131031021001 its reverse (100120130131011), we get a palindrome (210251161152012).
The spelling of 110131031021001 in words is "one hundred ten trillion, one hundred thirty-one billion, thirty-one million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •