Base | Representation |
---|---|
bin | 1001100011111000010011… |
… | …0101010000000101011101 |
3 | 1101012221100022000021200220 |
4 | 2120332010311100011131 |
5 | 2334212100430302331 |
6 | 34205052523511553 |
7 | 2133316331452116 |
oct | 230760465200535 |
9 | 41187308007626 |
10 | 10512013525341 |
11 | 3393135650959 |
12 | 12193700885b9 |
13 | 5b3381195173 |
14 | 284ad9a9120d |
15 | 1336955b9296 |
hex | 98f84d5015d |
10512013525341 has 8 divisors (see below), whose sum is σ = 14076172618560. Its totient is φ = 6977931724512.
The previous prime is 10512013525297. The next prime is 10512013525357. The reversal of 10512013525341 is 14352531021501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10512013525341 - 215 = 10512013492573 is a prime.
It is a super-2 number, since 2×105120135253412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10512013520341) 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, 7519322281 + ... + 7519323678.
It is an arithmetic number, because the mean of its divisors is an integer number (1759521577320).
Almost surely, 210512013525341 is an apocalyptic number.
It is an amenable number.
10512013525341 is a deficient number, since it is larger than the sum of its proper divisors (3564159093219).
10512013525341 is a wasteful number, since it uses less digits than its factorization.
10512013525341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15038646195.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 10512013525341 its reverse (14352531021501), we get a palindrome (24864544546842).
The spelling of 10512013525341 in words is "ten trillion, five hundred twelve billion, thirteen million, five hundred twenty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •