Base | Representation |
---|---|
bin | 1011111011001000011111… |
… | …1100101001011111001011 |
3 | 1201102100112202021120011210 |
4 | 2332302013330221133023 |
5 | 3204300321334310443 |
6 | 43514520141224203 |
7 | 2522126634602655 |
oct | 276620774513713 |
9 | 51370482246153 |
10 | 13110521010123 |
11 | 41a5160357489 |
12 | 1578aa6b62063 |
13 | 7414170b5524 |
14 | 3347a44ad6d5 |
15 | 17b07c397c33 |
hex | bec87f297cb |
13110521010123 has 12 divisors (see below), whose sum is σ = 17965914844920. Its totient is φ = 8504121733632.
The previous prime is 13110521010079. The next prime is 13110521010151. The reversal of 13110521010123 is 32101012501131.
It is not a de Polignac number, because 13110521010123 - 210 = 13110521009099 is a prime.
It is a super-2 number, since 2×131105210101232 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13110521010123.
It is not an unprimeable number, because it can be changed into a prime (13110521010023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1596114838 + ... + 1596123051.
It is an arithmetic number, because the mean of its divisors is an integer number (1497159570410).
Almost surely, 213110521010123 is an apocalyptic number.
13110521010123 is a deficient number, since it is larger than the sum of its proper divisors (4855393834797).
13110521010123 is an equidigital number, since it uses as much as digits as its factorization.
13110521010123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3192237966 (or 3192237929 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 13110521010123 its reverse (32101012501131), we get a palindrome (45211533511254).
The spelling of 13110521010123 in words is "thirteen trillion, one hundred ten billion, five hundred twenty-one million, ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •