Base | Representation |
---|---|
bin | 1001100100100010101111… |
… | …0101011110100001010111 |
3 | 1101021000202012200010010101 |
4 | 2121020223311132201113 |
5 | 2334403413230023020 |
6 | 34214215145234531 |
7 | 2134201536200260 |
oct | 231105365364127 |
9 | 41230665603111 |
10 | 10523405314135 |
11 | 3397a50a5643a |
12 | 121b60b192a47 |
13 | 5b44783177ac |
14 | 28549a9c9967 |
15 | 133b1074900a |
hex | 9922bd5e857 |
10523405314135 has 32 divisors (see below), whose sum is σ = 14932249689600. Its totient is φ = 6966056952960.
The previous prime is 10523405314129. The next prime is 10523405314151. The reversal of 10523405314135 is 53141350432501.
It is not a de Polignac number, because 10523405314135 - 211 = 10523405312087 is a prime.
It is a super-2 number, since 2×105234053141352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10523405314094 and 10523405314103.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 5238756 + ... + 6963574.
It is an arithmetic number, because the mean of its divisors is an integer number (466632802800).
Almost surely, 210523405314135 is an apocalyptic number.
10523405314135 is a deficient number, since it is larger than the sum of its proper divisors (4408844375465).
10523405314135 is a wasteful number, since it uses less digits than its factorization.
10523405314135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1730871.
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 10523405314135 its reverse (53141350432501), we get a palindrome (63664755746636).
The spelling of 10523405314135 in words is "ten trillion, five hundred twenty-three billion, four hundred five million, three hundred fourteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •