Base | Representation |
---|---|
bin | 111010100011000000101… |
… | …100100101001010110111 |
3 | 112020121220020201100112012 |
4 | 322203000230211022313 |
5 | 1011404231002113421 |
6 | 12320142211514435 |
7 | 563450451204101 |
oct | 72430054451267 |
9 | 15217806640465 |
10 | 4023322301111 |
11 | 1311310607693 |
12 | 54b8b65b8a1b |
13 | 2325228932c9 |
14 | dca30968571 |
15 | 6e9c873195b |
hex | 3a8c0b252b7 |
4023322301111 has 2 divisors, whose sum is σ = 4023322301112. Its totient is φ = 4023322301110.
The previous prime is 4023322301059. The next prime is 4023322301147. The reversal of 4023322301111 is 1111032233204.
4023322301111 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4023322301111 is a prime.
It is a super-2 number, since 2×40233223011112 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4023322301161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011661150555 + 2011661150556.
It is an arithmetic number, because the mean of its divisors is an integer number (2011661150556).
Almost surely, 24023322301111 is an apocalyptic number.
4023322301111 is a deficient number, since it is larger than the sum of its proper divisors (1).
4023322301111 is an equidigital number, since it uses as much as digits as its factorization.
4023322301111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 4023322301111 its reverse (1111032233204), we get a palindrome (5134354534315).
The spelling of 4023322301111 in words is "four trillion, twenty-three billion, three hundred twenty-two million, three hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •