Base | Representation |
---|---|
bin | 1001001001111011010101… |
… | …01110100010011110101111 |
3 | 2122021121222202120202122210 |
4 | 10210331222232202132233 |
5 | 10114321423342113403 |
6 | 110452352455341503 |
7 | 4145340135023226 |
oct | 444755256423657 |
9 | 78247882522583 |
10 | 20132302301103 |
11 | 646207488a053 |
12 | 2311937381893 |
13 | b30611157bc5 |
14 | 4d85a13d3cbd |
15 | 24da49dc2b03 |
hex | 124f6aba27af |
20132302301103 has 4 divisors (see below), whose sum is σ = 26843069734808. Its totient is φ = 13421534867400.
The previous prime is 20132302301093. The next prime is 20132302301143. The reversal of 20132302301103 is 30110320323102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 20132302301103 - 214 = 20132302284719 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 20132302301103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132302301143) 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, 3355383716848 + ... + 3355383716853.
It is an arithmetic number, because the mean of its divisors is an integer number (6710767433702).
Almost surely, 220132302301103 is an apocalyptic number.
20132302301103 is a deficient number, since it is larger than the sum of its proper divisors (6710767433705).
20132302301103 is an equidigital number, since it uses as much as digits as its factorization.
20132302301103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6710767433704.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20132302301103 its reverse (30110320323102), we get a palindrome (50242622624205).
The spelling of 20132302301103 in words is "twenty trillion, one hundred thirty-two billion, three hundred two million, three hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •