Base | Representation |
---|---|
bin | 100100100011001101100… |
… | …1111010001101011111111 |
3 | 122210020022212022111112201 |
4 | 1021012123033101223333 |
5 | 1124300431314221421 |
6 | 14403421115012331 |
7 | 1025634030014626 |
oct | 111063317215377 |
9 | 18706285274481 |
10 | 5023421242111 |
11 | 166746a3703a8 |
12 | 6916a573a0a7 |
13 | 2a59254c15cc |
14 | 1351c61a86bd |
15 | 8aa0d9ddb91 |
hex | 4919b3d1aff |
5023421242111 has 4 divisors (see below), whose sum is σ = 5318916609312. Its totient is φ = 4727925874912.
The previous prime is 5023421242087. The next prime is 5023421242117. The reversal of 5023421242111 is 1112421243205.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5023421242111 - 27 = 5023421241983 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5023421242111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5023421242117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147747683575 + ... + 147747683608.
It is an arithmetic number, because the mean of its divisors is an integer number (1329729152328).
Almost surely, 25023421242111 is an apocalyptic number.
5023421242111 is a deficient number, since it is larger than the sum of its proper divisors (295495367201).
5023421242111 is a wasteful number, since it uses less digits than its factorization.
5023421242111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295495367200.
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 5023421242111 its reverse (1112421243205), we get a palindrome (6135842485316).
The spelling of 5023421242111 in words is "five trillion, twenty-three billion, four hundred twenty-one million, two hundred forty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •