Base | Representation |
---|---|
bin | 1011000011010010001111… |
… | …11000110000010110111011 |
3 | 10012001021001021222022220201 |
4 | 11201221013320300112323 |
5 | 11141131231020134433 |
6 | 123404124520303031 |
7 | 5055525314235325 |
oct | 541510770602673 |
9 | 105037037868821 |
10 | 24302131021243 |
11 | 781a526451789 |
12 | 2885aba611a77 |
13 | 10738b156a98a |
14 | 60032d742615 |
15 | 2c224a643a7d |
hex | 161a47e305bb |
24302131021243 has 2 divisors, whose sum is σ = 24302131021244. Its totient is φ = 24302131021242.
The previous prime is 24302131021241. The next prime is 24302131021261. The reversal of 24302131021243 is 34212013120342.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 24302131021243 - 21 = 24302131021241 is a prime.
It is a super-2 number, since 2×243021310212432 (a number of 28 digits) contains 22 as substring.
Together with 24302131021241, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (24302131021241) by changing a digit.
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 as a sum of consecutive naturals, namely, 12151065510621 + 12151065510622.
It is an arithmetic number, because the mean of its divisors is an integer number (12151065510622).
Almost surely, 224302131021243 is an apocalyptic number.
24302131021243 is a deficient number, since it is larger than the sum of its proper divisors (1).
24302131021243 is an equidigital number, since it uses as much as digits as its factorization.
24302131021243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 24302131021243 its reverse (34212013120342), we get a palindrome (58514144141585).
The spelling of 24302131021243 in words is "twenty-four trillion, three hundred two billion, one hundred thirty-one million, twenty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •