Base | Representation |
---|---|
bin | 1011111010100101100001… |
… | …0101010000011001110111 |
3 | 1201101110022102121121102010 |
4 | 2332221120111100121313 |
5 | 3204122104322020043 |
6 | 43510324351015303 |
7 | 2521345161316041 |
oct | 276513025203167 |
9 | 51343272547363 |
10 | 13101132220023 |
11 | 41a1182657521 |
12 | 157710680a533 |
13 | 74057bc1a123 |
14 | 3341535b0a91 |
15 | 17abccebe133 |
hex | bea58550677 |
13101132220023 has 4 divisors (see below), whose sum is σ = 17468176293368. Its totient is φ = 8734088146680.
The previous prime is 13101132220019. The next prime is 13101132220037. The reversal of 13101132220023 is 32002223110131.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13101132220023 - 22 = 13101132220019 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 (13101132220013) 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, 2183522036668 + ... + 2183522036673.
It is an arithmetic number, because the mean of its divisors is an integer number (4367044073342).
Almost surely, 213101132220023 is an apocalyptic number.
13101132220023 is a deficient number, since it is larger than the sum of its proper divisors (4367044073345).
13101132220023 is an equidigital number, since it uses as much as digits as its factorization.
13101132220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4367044073344.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13101132220023 its reverse (32002223110131), we get a palindrome (45103355330154).
The spelling of 13101132220023 in words is "thirteen trillion, one hundred one billion, one hundred thirty-two million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •