Base | Representation |
---|---|
bin | 1001100100100001110011… |
… | …0001000111111111101111 |
3 | 1101021000002120222120222111 |
4 | 2121020130301013333233 |
5 | 2334402404020440210 |
6 | 34214134115024451 |
7 | 2134162346346565 |
oct | 231103461077757 |
9 | 41230076876874 |
10 | 10523152515055 |
11 | 3397931290784 |
12 | 121b55a59b127 |
13 | 5b4437b3503b |
14 | 2854751c1a35 |
15 | 133ae846088a |
hex | 9921cc47fef |
10523152515055 has 8 divisors (see below), whose sum is σ = 12805639117344. Its totient is φ = 8299951279200.
The previous prime is 10523152515047. The next prime is 10523152515089. The reversal of 10523152515055 is 55051525132501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10523152515055 - 23 = 10523152515047 is a prime.
It is a super-2 number, since 2×105231525150552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10523152514999 and 10523152515017.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14821341216 + ... + 14821341925.
It is an arithmetic number, because the mean of its divisors is an integer number (1600704889668).
Almost surely, 210523152515055 is an apocalyptic number.
10523152515055 is a deficient number, since it is larger than the sum of its proper divisors (2282486602289).
10523152515055 is an equidigital number, since it uses as much as digits as its factorization.
10523152515055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29642683217.
The product of its (nonzero) digits is 187500, while the sum is 40.
Adding to 10523152515055 its reverse (55051525132501), we get a palindrome (65574677647556).
The spelling of 10523152515055 in words is "ten trillion, five hundred twenty-three billion, one hundred fifty-two million, five hundred fifteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •