Base | Representation |
---|---|
bin | 1001100011111000011101… |
… | …01011010010010001111100 |
3 | 2202102212220110020212000111 |
4 | 10301330032223102101330 |
5 | 10223424334423021022 |
6 | 112414202054035404 |
7 | 4266641034060406 |
oct | 461741653222174 |
9 | 82385813225014 |
10 | 21024111142012 |
11 | 6776303707880 |
12 | 2436744348b64 |
13 | b967468c09c4 |
14 | 529802991b76 |
15 | 266d43244477 |
hex | 131f0ead247c |
21024111142012 has 24 divisors (see below), whose sum is σ = 40238040089520. Its totient is φ = 9532342575360.
The previous prime is 21024111141983. The next prime is 21024111142081.
21024111142012 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 601771837 + ... + 601806772.
It is an arithmetic number, because the mean of its divisors is an integer number (1676585003730).
Almost surely, 221024111142012 is an apocalyptic number.
21024111142012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21024111142012 is a deficient number, since it is larger than the sum of its proper divisors (19213928947508).
21024111142012 is a wasteful number, since it uses less digits than its factorization.
21024111142012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1203579021 (or 1203579019 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 22.
It can be divided in two parts, 2102411 and 1142012, that added together give a palindrome (3244423).
The spelling of 21024111142012 in words is "twenty-one trillion, twenty-four billion, one hundred eleven million, one hundred forty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •