Base | Representation |
---|---|
bin | 1001100011100100001011… |
… | …00101011111111111100101 |
3 | 2202101211210111221002121020 |
4 | 10301302011211133333211 |
5 | 10223240034112242013 |
6 | 112405201321041353 |
7 | 4266104132150613 |
oct | 461620545377745 |
9 | 82354714832536 |
10 | 21013221212133 |
11 | 6771725619327 |
12 | 2434605326259 |
13 | b956cc724607 |
14 | 52908c5746b3 |
15 | 266907198623 |
hex | 131c8595ffe5 |
21013221212133 has 8 divisors (see below), whose sum is σ = 29235786034368. Its totient is φ = 13399735265664.
The previous prime is 21013221212089. The next prime is 21013221212171. The reversal of 21013221212133 is 33121212231012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21013221212133 - 232 = 21008926244837 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21013221210133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152269718860 + ... + 152269718997.
It is an arithmetic number, because the mean of its divisors is an integer number (3654473254296).
Almost surely, 221013221212133 is an apocalyptic number.
21013221212133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
21013221212133 is a deficient number, since it is larger than the sum of its proper divisors (8222564822235).
21013221212133 is a wasteful number, since it uses less digits than its factorization.
21013221212133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304539437883.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 21013221212133 its reverse (33121212231012), we get a palindrome (54134433443145).
The spelling of 21013221212133 in words is "twenty-one trillion, thirteen billion, two hundred twenty-one million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •