Base | Representation |
---|---|
bin | 11110100100111011111… |
… | …011000011010000101101 |
3 | 21102212200022221101101012 |
4 | 132210323323003100231 |
5 | 233411322022441331 |
6 | 4245144234355005 |
7 | 304544536136513 |
oct | 36447373032055 |
9 | 7385608841335 |
10 | 2101244343341 |
11 | 74015071a510 |
12 | 29b29a58ba65 |
13 | 1231b9ac2a40 |
14 | 739b4ca44b3 |
15 | 399d15b182b |
hex | 1e93bec342d |
2101244343341 has 16 divisors (see below), whose sum is σ = 2468689429248. Its totient is φ = 1763214340800.
The previous prime is 2101244343323. The next prime is 2101244343349. The reversal of 2101244343341 is 1433434421012.
It is not a de Polignac number, because 2101244343341 - 214 = 2101244326957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101244343298 and 2101244343307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101244343349) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3651131 + ... + 4187271.
It is an arithmetic number, because the mean of its divisors is an integer number (154293089328).
Almost surely, 22101244343341 is an apocalyptic number.
It is an amenable number.
2101244343341 is a deficient number, since it is larger than the sum of its proper divisors (367445085907).
2101244343341 is a wasteful number, since it uses less digits than its factorization.
2101244343341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563572.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 2101244343341 its reverse (1433434421012), we get a palindrome (3534678764353).
The spelling of 2101244343341 in words is "two trillion, one hundred one billion, two hundred forty-four million, three hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •