Base | Representation |
---|---|
bin | 1001101010011111001100… |
… | …1100000010001010010001 |
3 | 1101121210100202002001221020 |
4 | 2122213303030002022101 |
5 | 2343042043220003243 |
6 | 34333145240350053 |
7 | 2144445432664305 |
oct | 232476314021221 |
9 | 41553322061836 |
10 | 10625534141073 |
11 | 342729a019745 |
12 | 1237371a75329 |
13 | 5c0ca2b99137 |
14 | 28a3c867bd05 |
15 | 1365db7e2283 |
hex | 9a9f3302291 |
10625534141073 has 32 divisors (see below), whose sum is σ = 14459567126400. Its totient is φ = 6939087091200.
The previous prime is 10625534141011. The next prime is 10625534141113. The reversal of 10625534141073 is 37014143552601.
It is a happy number.
It is not a de Polignac number, because 10625534141073 - 218 = 10625533878929 is a prime.
It is a super-2 number, since 2×106255341410732 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10625534141273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 425502478 + ... + 425527448.
It is an arithmetic number, because the mean of its divisors is an integer number (451861472700).
Almost surely, 210625534141073 is an apocalyptic number.
It is an amenable number.
10625534141073 is a deficient number, since it is larger than the sum of its proper divisors (3834032985327).
10625534141073 is a wasteful number, since it uses less digits than its factorization.
10625534141073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39793.
The product of its (nonzero) digits is 302400, while the sum is 42.
Adding to 10625534141073 its reverse (37014143552601), we get a palindrome (47639677693674).
The spelling of 10625534141073 in words is "ten trillion, six hundred twenty-five billion, five hundred thirty-four million, one hundred forty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •