Base | Representation |
---|---|
bin | 10011000110110101100… |
… | …011110110100101110110 |
3 | 11122112010000000211001120 |
4 | 103012311203312211312 |
5 | 133003021320200042 |
6 | 2443104452404410 |
7 | 163601432126526 |
oct | 23066543664566 |
9 | 4575100024046 |
10 | 1313011100022 |
11 | 466932599216 |
12 | 192578916706 |
13 | 96a7c8845ab |
14 | 4779b5a3686 |
15 | 2424b31adec |
hex | 131b58f6976 |
1313011100022 has 8 divisors (see below), whose sum is σ = 2626022200056. Its totient is φ = 437670366672.
The previous prime is 1313011099951. The next prime is 1313011100039. The reversal of 1313011100022 is 2200011103131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1313011100022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1313011099974 and 1313011100010.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 109417591663 + ... + 109417591674.
It is an arithmetic number, because the mean of its divisors is an integer number (328252775007).
Almost surely, 21313011100022 is an apocalyptic number.
1313011100022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1313011100022 is a wasteful number, since it uses less digits than its factorization.
1313011100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218835183342.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1313011100022 its reverse (2200011103131), we get a palindrome (3513022203153).
The spelling of 1313011100022 in words is "one trillion, three hundred thirteen billion, eleven million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •