Base | Representation |
---|---|
bin | 1011110100110000111101… |
… | …0100110010000001101111 |
3 | 1201000220011121211110222001 |
4 | 2331030033110302001233 |
5 | 3201002300004023043 |
6 | 43352344500433131 |
7 | 2511204644031505 |
oct | 275141724620157 |
9 | 51026147743861 |
10 | 13001123111023 |
11 | 416282206a723 |
12 | 155b8559a87a7 |
13 | 73400156b558 |
14 | 32d38725c675 |
15 | 1782c808574d |
hex | bd30f53206f |
13001123111023 has 4 divisors (see below), whose sum is σ = 13002070659408. Its totient is φ = 13000175562640.
The previous prime is 13001123111021. The next prime is 13001123111057. The reversal of 13001123111023 is 32011132110031.
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 13001123111023 - 21 = 13001123111021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13001123111021) 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 in 3 ways as a sum of consecutive naturals, for example, 473753611 + ... + 473781052.
It is an arithmetic number, because the mean of its divisors is an integer number (3250517664852).
Almost surely, 213001123111023 is an apocalyptic number.
13001123111023 is a deficient number, since it is larger than the sum of its proper divisors (947548385).
13001123111023 is an equidigital number, since it uses as much as digits as its factorization.
13001123111023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947548384.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13001123111023 its reverse (32011132110031), we get a palindrome (45012255221054).
The spelling of 13001123111023 in words is "thirteen trillion, one billion, one hundred twenty-three million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •