Base | Representation |
---|---|
bin | 101101001001000100110… |
… | …100100111110110011001 |
3 | 101222120010011000021010210 |
4 | 231021010310213312121 |
5 | 401311120441024423 |
6 | 10333032243401333 |
7 | 440056310500434 |
oct | 55110464476631 |
9 | 11876104007123 |
10 | 3102121033113 |
11 | a966694a6403 |
12 | 421266083249 |
13 | 1966b48b2c0b |
14 | aa20191a81b |
15 | 55a5ec9cb93 |
hex | 2d244d27d99 |
3102121033113 has 32 divisors (see below), whose sum is σ = 4417105858560. Its totient is φ = 1932227599680.
The previous prime is 3102121033097. The next prime is 3102121033117. The reversal of 3102121033113 is 3113301212013.
It is a happy number.
3102121033113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3102121033113 - 24 = 3102121033097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3102121033113.
It is not an unprimeable number, because it can be changed into a prime (3102121033117) 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, 55819006 + ... + 55874552.
It is an arithmetic number, because the mean of its divisors is an integer number (138034558080).
Almost surely, 23102121033113 is an apocalyptic number.
It is an amenable number.
3102121033113 is a deficient number, since it is larger than the sum of its proper divisors (1314984825447).
3102121033113 is a wasteful number, since it uses less digits than its factorization.
3102121033113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76317.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 3102121033113 its reverse (3113301212013), we get a palindrome (6215422245126).
The spelling of 3102121033113 in words is "three trillion, one hundred two billion, one hundred twenty-one million, thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •