Base | Representation |
---|---|
bin | 10111000010010011001101… |
… | …010100101001100010001101 |
3 | 111021201102220110022210002110 |
4 | 113002103031110221202031 |
5 | 101234403244112222313 |
6 | 555250335543014233 |
7 | 30224426614201404 |
oct | 2702231524514215 |
9 | 437642813283073 |
10 | 101313133320333 |
11 | 2a310727593310 |
12 | b4431b743a379 |
13 | 446ba31120c3c |
14 | 1b0382070c63b |
15 | baa5c16cdec3 |
hex | 5c24cd52988d |
101313133320333 has 32 divisors (see below), whose sum is σ = 149772945024000. Its totient is φ = 60402256409600.
The previous prime is 101313133320283. The next prime is 101313133320359. The reversal of 101313133320333 is 333023331313101.
It is a cyclic number.
It is not a de Polignac number, because 101313133320333 - 221 = 101313131223181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101313133320333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101313133220333) 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, 47100303 + ... + 49204316.
It is an arithmetic number, because the mean of its divisors is an integer number (4680404532000).
Almost surely, 2101313133320333 is an apocalyptic number.
It is an amenable number.
101313133320333 is a deficient number, since it is larger than the sum of its proper divisors (48459811703667).
101313133320333 is a wasteful number, since it uses less digits than its factorization.
101313133320333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96305153.
The product of its (nonzero) digits is 13122, while the sum is 30.
Adding to 101313133320333 its reverse (333023331313101), we get a palindrome (434336464633434).
The spelling of 101313133320333 in words is "one hundred one trillion, three hundred thirteen billion, one hundred thirty-three million, three hundred twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •