Base | Representation |
---|---|
bin | 1011110111101001011101… |
… | …0101111001110010101011 |
3 | 1201012122000012221020200100 |
4 | 2331322113111321302223 |
5 | 3202310212313342403 |
6 | 43431215152240443 |
7 | 2514610160344200 |
oct | 275722725716253 |
9 | 51178005836610 |
10 | 13050649746603 |
11 | 4181827609007 |
12 | 1569378240123 |
13 | 738895220991 |
14 | 331924b6bca7 |
15 | 1797260c42a3 |
hex | bde97579cab |
13050649746603 has 72 divisors (see below), whose sum is σ = 21954200748480. Its totient is φ = 7448827932000.
The previous prime is 13050649746481. The next prime is 13050649746613. The reversal of 13050649746603 is 30664794605031.
13050649746603 is a `hidden beast` number, since 1 + 3 + 0 + 50 + 6 + 497 + 46 + 60 + 3 = 666.
It is not a de Polignac number, because 13050649746603 - 214 = 13050649730219 is a prime.
It is a super-2 number, since 2×130506497466032 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13050649746603.
It is not an unprimeable number, because it can be changed into a prime (13050649746613) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2045873868 + ... + 2045880246.
It is an arithmetic number, because the mean of its divisors is an integer number (304919454840).
Almost surely, 213050649746603 is an apocalyptic number.
13050649746603 is a deficient number, since it is larger than the sum of its proper divisors (8903551001877).
13050649746603 is a wasteful number, since it uses less digits than its factorization.
13050649746603 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11077 (or 11067 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 54.
The spelling of 13050649746603 in words is "thirteen trillion, fifty billion, six hundred forty-nine million, seven hundred forty-six thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •