Base | Representation |
---|---|
bin | 1011111101101011101000… |
… | …1110011100111110010111 |
3 | 1201120112120202220200100220 |
4 | 2333122322032130332113 |
5 | 3211010013414224343 |
6 | 43551001501405423 |
7 | 2525240111635053 |
oct | 277327216347627 |
9 | 51515522820326 |
10 | 13154314211223 |
11 | 4211793492669 |
12 | 1585489269873 |
13 | 7455a5c91683 |
14 | 33695a75cc63 |
15 | 17c291da6183 |
hex | bf6ba39cf97 |
13154314211223 has 4 divisors (see below), whose sum is σ = 17539085614968. Its totient is φ = 8769542807480.
The previous prime is 13154314211219. The next prime is 13154314211231. The reversal of 13154314211223 is 32211241345131.
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 13154314211223 - 22 = 13154314211219 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13154314211923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2192385701868 + ... + 2192385701873.
It is an arithmetic number, because the mean of its divisors is an integer number (4384771403742).
Almost surely, 213154314211223 is an apocalyptic number.
13154314211223 is a deficient number, since it is larger than the sum of its proper divisors (4384771403745).
13154314211223 is an equidigital number, since it uses as much as digits as its factorization.
13154314211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4384771403744.
The product of its digits is 17280, while the sum is 33.
Adding to 13154314211223 its reverse (32211241345131), we get a palindrome (45365555556354).
The spelling of 13154314211223 in words is "thirteen trillion, one hundred fifty-four billion, three hundred fourteen million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •