Base | Representation |
---|---|
bin | 11000001110111010… |
… | …11001111001100110 |
3 | 1020120200201001101020 |
4 | 30013131121321212 |
5 | 203121033110122 |
6 | 5550550312010 |
7 | 640254414600 |
oct | 140735317146 |
9 | 36520631336 |
10 | 13010050662 |
11 | 557691a694 |
12 | 2631058606 |
13 | 12c44b063b |
14 | 8b5c24170 |
15 | 512289c5c |
hex | 307759e66 |
13010050662 has 48 divisors (see below), whose sum is σ = 30839417712. Its totient is φ = 3647017920.
The previous prime is 13010050637. The next prime is 13010050679. The reversal of 13010050662 is 26605001031.
It is a super-2 number, since 2×130100506622 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 401889 + ... + 433052.
It is an arithmetic number, because the mean of its divisors is an integer number (642487869).
Almost surely, 213010050662 is an apocalyptic number.
13010050662 is an abundant number, since it is smaller than the sum of its proper divisors (17829367050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13010050662 is a wasteful number, since it uses less digits than its factorization.
13010050662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835013 (or 835006 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 13010050662 its reverse (26605001031), we get a palindrome (39615051693).
The spelling of 13010050662 in words is "thirteen billion, ten million, fifty thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •