Base | Representation |
---|---|
bin | 1001001101000110000010… |
… | …10111010110110010100101 |
3 | 2122200000220011010220022010 |
4 | 10212203001113112302211 |
5 | 10123112313241232401 |
6 | 111014351411224433 |
7 | 4156242033301410 |
oct | 446430127266245 |
9 | 78600804126263 |
10 | 20241130024101 |
11 | 64a4240239098 |
12 | 232aa495a8119 |
13 | b3a96581907c |
14 | 4dd966a22b77 |
15 | 2517b9108ed6 |
hex | 1268c15d6ca5 |
20241130024101 has 32 divisors (see below), whose sum is σ = 30955780942848. Its totient is φ = 11524310542080.
The previous prime is 20241130024081. The next prime is 20241130024163. The reversal of 20241130024101 is 10142003114202.
It is not a de Polignac number, because 20241130024101 - 25 = 20241130024069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20241130024901) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 59659021 + ... + 59997341.
It is an arithmetic number, because the mean of its divisors is an integer number (967368154464).
Almost surely, 220241130024101 is an apocalyptic number.
20241130024101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20241130024101 is a deficient number, since it is larger than the sum of its proper divisors (10714650918747).
20241130024101 is a wasteful number, since it uses less digits than its factorization.
20241130024101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348681.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 20241130024101 its reverse (10142003114202), we get a palindrome (30383133138303).
The spelling of 20241130024101 in words is "twenty trillion, two hundred forty-one billion, one hundred thirty million, twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •