Base | Representation |
---|---|
bin | 1011111011111111111101… |
… | …1110001110010001001011 |
3 | 1201110202222110210200121101 |
4 | 2332333333132032101023 |
5 | 3210021320231431443 |
6 | 43525421453522231 |
7 | 2523164632260313 |
oct | 276777736162113 |
9 | 51422873720541 |
10 | 13125411202123 |
11 | 4200501499090 |
12 | 157b9617a3377 |
13 | 74294ac6571c |
14 | 3353b7cac443 |
15 | 17b64e71b84d |
hex | befff78e44b |
13125411202123 has 8 divisors (see below), whose sum is σ = 14318804828160. Its totient is φ = 11932046647080.
The previous prime is 13125411202117. The next prime is 13125411202151. The reversal of 13125411202123 is 32120211452131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13125411202123 - 29 = 13125411201611 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13125411202091 and 13125411202100.
It is not an unprimeable number, because it can be changed into a prime (13125411202153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6318315 + ... + 8134612.
It is an arithmetic number, because the mean of its divisors is an integer number (1789850603520).
Almost surely, 213125411202123 is an apocalyptic number.
13125411202123 is a deficient number, since it is larger than the sum of its proper divisors (1193393626037).
13125411202123 is a wasteful number, since it uses less digits than its factorization.
13125411202123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14535497.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 13125411202123 its reverse (32120211452131), we get a palindrome (45245622654254).
The spelling of 13125411202123 in words is "thirteen trillion, one hundred twenty-five billion, four hundred eleven million, two hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •