Base | Representation |
---|---|
bin | 1001100100111100000110… |
… | …1111100001101111001101 |
3 | 1101021200022210212110012110 |
4 | 2121033001233201233031 |
5 | 2340011340104213031 |
6 | 34221303015054233 |
7 | 2134532360150451 |
oct | 231170157415715 |
9 | 41250283773173 |
10 | 10530215304141 |
11 | 339a926020755 |
12 | 12209ab971379 |
13 | 5b4cc2153590 |
14 | 285945204661 |
15 | 133dad52dc46 |
hex | 993c1be1bcd |
10530215304141 has 16 divisors (see below), whose sum is σ = 15121519769664. Its totient is φ = 6479613659904.
The previous prime is 10530215304137. The next prime is 10530215304149. The reversal of 10530215304141 is 14140351203501.
It is not a de Polignac number, because 10530215304141 - 22 = 10530215304137 is a prime.
It is a super-2 number, since 2×105302153041412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10530215304099 and 10530215304108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10530215304149) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10315431 + ... + 11290196.
It is an arithmetic number, because the mean of its divisors is an integer number (945094985604).
Almost surely, 210530215304141 is an apocalyptic number.
It is an amenable number.
10530215304141 is a deficient number, since it is larger than the sum of its proper divisors (4591304465523).
10530215304141 is a wasteful number, since it uses less digits than its factorization.
10530215304141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21618140.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 10530215304141 its reverse (14140351203501), we get a palindrome (24670566507642).
The spelling of 10530215304141 in words is "ten trillion, five hundred thirty billion, two hundred fifteen million, three hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •