Base | Representation |
---|---|
bin | 1100110100000011000… |
… | …1110100000010011011 |
3 | 210001012020200100110102 |
4 | 3031000301310002123 |
5 | 12101311303211443 |
6 | 245043144410015 |
7 | 21622013151566 |
oct | 3150061640233 |
9 | 701166610412 |
10 | 220130132123 |
11 | 853a17a2430 |
12 | 367b517690b |
13 | 179b195a765 |
14 | a92379d4dd |
15 | 5ad5847cb8 |
hex | 3340c7409b |
220130132123 has 4 divisors (see below), whose sum is σ = 240141962328. Its totient is φ = 200118301920.
The previous prime is 220130132099. The next prime is 220130132137. The reversal of 220130132123 is 321231031022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 220130132123 - 26 = 220130132059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220130132095 and 220130132104.
It is not an unprimeable number, because it can be changed into a prime (220130132323) 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, 10005915086 + ... + 10005915107.
It is an arithmetic number, because the mean of its divisors is an integer number (60035490582).
Almost surely, 2220130132123 is an apocalyptic number.
220130132123 is a deficient number, since it is larger than the sum of its proper divisors (20011830205).
220130132123 is a wasteful number, since it uses less digits than its factorization.
220130132123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20011830204.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 220130132123 its reverse (321231031022), we get a palindrome (541361163145).
It can be divided in two parts, 220130 and 132123, that added together give a palindrome (352253).
The spelling of 220130132123 in words is "two hundred twenty billion, one hundred thirty million, one hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •