Base | Representation |
---|---|
bin | 1001001101110100110101… |
… | …0101100100001010100011 |
3 | 1022212201100221001201201210 |
4 | 2103131031111210022203 |
5 | 2312010120042200201 |
6 | 33315032111201203 |
7 | 2064044202220344 |
oct | 223351525441243 |
9 | 38781327051653 |
10 | 10133125350051 |
11 | 32574860a9980 |
12 | 1177a4b216203 |
13 | 58671b6926c2 |
14 | 2706357100cb |
15 | 1288bc35b1d6 |
hex | 9374d5642a3 |
10133125350051 has 32 divisors (see below), whose sum is σ = 15505765459200. Its totient is φ = 5829019172480.
The previous prime is 10133125350013. The next prime is 10133125350067. The reversal of 10133125350051 is 15005352133101.
It is not a de Polignac number, because 10133125350051 - 26 = 10133125349987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10133125350091) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 89675976 + ... + 89788901.
It is an arithmetic number, because the mean of its divisors is an integer number (484555170600).
Almost surely, 210133125350051 is an apocalyptic number.
10133125350051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10133125350051 is a deficient number, since it is larger than the sum of its proper divisors (5372640109149).
10133125350051 is a wasteful number, since it uses less digits than its factorization.
10133125350051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179464979.
The product of its (nonzero) digits is 6750, while the sum is 30.
Adding to 10133125350051 its reverse (15005352133101), we get a palindrome (25138477483152).
The spelling of 10133125350051 in words is "ten trillion, one hundred thirty-three billion, one hundred twenty-five million, three hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •