Base | Representation |
---|---|
bin | 1001101100001110110111… |
… | …11110101111001100100000 |
3 | 2210110022110212022022100102 |
4 | 10312013123332233030200 |
5 | 10243124433443141000 |
6 | 113154052103441532 |
7 | 4326446012115560 |
oct | 466073376571440 |
9 | 83408425268312 |
10 | 21311023412000 |
11 | 6876a55158883 |
12 | 24822767562a8 |
13 | bb780c111c6a |
14 | 53965d84cda0 |
15 | 26e5369223d5 |
hex | 1361dbfaf320 |
21311023412000 has 96 divisors (see below), whose sum is σ = 59841353819520. Its totient is φ = 7306636588800.
The previous prime is 21311023411963. The next prime is 21311023412009. The reversal of 21311023412000 is 21432011312.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (21311023412009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 380525990 + ... + 380581989.
It is an arithmetic number, because the mean of its divisors is an integer number (623347435620).
Almost surely, 221311023412000 is an apocalyptic number.
21311023412000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21311023412000 is an abundant number, since it is smaller than the sum of its proper divisors (38530330407520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21311023412000 is an equidigital number, since it uses as much as digits as its factorization.
21311023412000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 761108011 (or 761107993 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 21311023412000 its reverse (21432011312), we get a palindrome (21332455423312).
The spelling of 21311023412000 in words is "twenty-one trillion, three hundred eleven billion, twenty-three million, four hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •