Base | Representation |
---|---|
bin | 1011110101111110110100… |
… | …0000001000101101000111 |
3 | 1201002220010002222122000001 |
4 | 2331133231000020231013 |
5 | 3201323100130010043 |
6 | 43410122342502131 |
7 | 2512544563424653 |
oct | 275375500105507 |
9 | 51086102878001 |
10 | 13022022110023 |
11 | 4170676aa7a23 |
12 | 1563908a34947 |
13 | 735c8227c054 |
14 | 3303aaabda63 |
15 | 178aecbd174d |
hex | bd7ed008b47 |
13022022110023 has 4 divisors (see below), whose sum is σ = 13205430872208. Its totient is φ = 12838613347840.
The previous prime is 13022022109991. The next prime is 13022022110039. The reversal of 13022022110023 is 32001122022031.
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 13022022110023 - 25 = 13022022109991 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 (13022022110093) 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, 91704380986 + ... + 91704381127.
It is an arithmetic number, because the mean of its divisors is an integer number (3301357718052).
Almost surely, 213022022110023 is an apocalyptic number.
13022022110023 is a deficient number, since it is larger than the sum of its proper divisors (183408762185).
13022022110023 is an equidigital number, since it uses as much as digits as its factorization.
13022022110023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183408762184.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 13022022110023 its reverse (32001122022031), we get a palindrome (45023144132054).
The spelling of 13022022110023 in words is "thirteen trillion, twenty-two billion, twenty-two million, one hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •