Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …0110110010011011011101 |
3 | 1022102222222112102101020211 |
4 | 2101223003112302123131 |
5 | 2303003102120034100 |
6 | 33142441144412421 |
7 | 2052144536232004 |
oct | 221530326623335 |
9 | 38388875371224 |
10 | 10010551330525 |
11 | 320a4a6284899 |
12 | 1158141477111 |
13 | 577cb6130975 |
14 | 2687285a9c3b |
15 | 1255e64081ba |
hex | 91ac35b26dd |
10010551330525 has 24 divisors (see below), whose sum is σ = 12590129430144. Its totient is φ = 7894640265600.
The previous prime is 10010551330477. The next prime is 10010551330541. The reversal of 10010551330525 is 52503315501001.
It is not a de Polignac number, because 10010551330525 - 27 = 10010551330397 is a prime.
It is a super-2 number, since 2×100105513305252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
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 23 ways as a sum of consecutive naturals, for example, 4330021 + ... + 6226570.
It is an arithmetic number, because the mean of its divisors is an integer number (524588726256).
Almost surely, 210010551330525 is an apocalyptic number.
It is an amenable number.
10010551330525 is a deficient number, since it is larger than the sum of its proper divisors (2579578099619).
10010551330525 is a wasteful number, since it uses less digits than its factorization.
10010551330525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10557141 (or 10557136 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 31.
Adding to 10010551330525 its reverse (52503315501001), we get a palindrome (62513866831526).
The spelling of 10010551330525 in words is "ten trillion, ten billion, five hundred fifty-one million, three hundred thirty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •