Base | Representation |
---|---|
bin | 1001101011111110010101… |
… | …00111001110111001011100 |
3 | 2210102110112220120001221221 |
4 | 10311333022213032321130 |
5 | 10243003241334300012 |
6 | 113150022522303124 |
7 | 4326012640205032 |
oct | 465771247167134 |
9 | 83373486501857 |
10 | 21302142103132 |
11 | 6873207964aa0 |
12 | 24805b8357aa4 |
13 | bb6a2511ac07 |
14 | 53905a0d2552 |
15 | 26e1b6d8d507 |
hex | 135fca9cee5c |
21302142103132 has 12 divisors (see below), whose sum is σ = 40667725833336. Its totient is φ = 9682791865040.
The previous prime is 21302142103103. The next prime is 21302142103133. The reversal of 21302142103132 is 23130124120312.
It is a junction number, because it is equal to n+sod(n) for n = 21302142103097 and 21302142103106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21302142103133) 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, 242069796583 + ... + 242069796670.
It is an arithmetic number, because the mean of its divisors is an integer number (3388977152778).
Almost surely, 221302142103132 is an apocalyptic number.
21302142103132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21302142103132 is a deficient number, since it is larger than the sum of its proper divisors (19365583730204).
21302142103132 is a wasteful number, since it uses less digits than its factorization.
21302142103132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484139593268 (or 484139593266 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 21302142103132 its reverse (23130124120312), we get a palindrome (44432266223444).
The spelling of 21302142103132 in words is "twenty-one trillion, three hundred two billion, one hundred forty-two million, one hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •