Base | Representation |
---|---|
bin | 1001001001111010111111… |
… | …10111000111111000110111 |
3 | 2122021121112001120000102222 |
4 | 10210331133313013320313 |
5 | 10114321040210031403 |
6 | 110452322424152555 |
7 | 4145332462351244 |
oct | 444753767077067 |
9 | 78247461500388 |
10 | 20132120002103 |
11 | 6461a9099711a |
12 | 23118a630875b |
13 | b305b245a785 |
14 | 4d85850dc5cb |
15 | 24da38db3338 |
hex | 124f5fdc7e37 |
20132120002103 has 8 divisors (see below), whose sum is σ = 20473419557760. Its totient is φ = 19790823019320.
The previous prime is 20132120002079. The next prime is 20132120002117. The reversal of 20132120002103 is 30120002123102.
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 20132120002103 - 210 = 20132120001079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132120008103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21609038 + ... + 22521428.
It is an arithmetic number, because the mean of its divisors is an integer number (2559177444720).
Almost surely, 220132120002103 is an apocalyptic number.
20132120002103 is a deficient number, since it is larger than the sum of its proper divisors (341299555657).
20132120002103 is an equidigital number, since it uses as much as digits as its factorization.
20132120002103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1286437.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20132120002103 its reverse (30120002123102), we get a palindrome (50252122125205).
The spelling of 20132120002103 in words is "twenty trillion, one hundred thirty-two billion, one hundred twenty million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •