Base | Representation |
---|---|
bin | 1011111101101111100000… |
… | …0110010000011011000011 |
3 | 1201120122021010011111221102 |
4 | 2333123320012100123003 |
5 | 3211014130134000201 |
6 | 43551252502245015 |
7 | 2525304615055244 |
oct | 277337006203303 |
9 | 51518233144842 |
10 | 13155352250051 |
11 | 42121764275a0 |
12 | 1585718a2676b |
13 | 74571005982b |
14 | 336a1856cccb |
15 | 17c30309d26b |
hex | bf6f81906c3 |
13155352250051 has 16 divisors (see below), whose sum is σ = 15995249573760. Its totient is φ = 10663499710080.
The previous prime is 13155352249979. The next prime is 13155352250071. The reversal of 13155352250051 is 15005225355131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13155352250051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13155352249987 and 13155352250014.
It is not an unprimeable number, because it can be changed into a prime (13155352250071) 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 15 ways as a sum of consecutive naturals, for example, 1851298481 + ... + 1851305586.
It is an arithmetic number, because the mean of its divisors is an integer number (999703098360).
Almost surely, 213155352250051 is an apocalyptic number.
13155352250051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13155352250051 is a deficient number, since it is larger than the sum of its proper divisors (2839897323709).
13155352250051 is a wasteful number, since it uses less digits than its factorization.
13155352250051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3702604114.
The product of its (nonzero) digits is 112500, while the sum is 38.
The spelling of 13155352250051 in words is "thirteen trillion, one hundred fifty-five billion, three hundred fifty-two million, two hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •