Base | Representation |
---|---|
bin | 1011111101011101111110… |
… | …0000000001000011001011 |
3 | 1201120012010000220101011011 |
4 | 2333113133200001003023 |
5 | 3210430010004331011 |
6 | 43545153413144351 |
7 | 2525050142540035 |
oct | 277273740010313 |
9 | 51505100811134 |
10 | 13150644605131 |
11 | 4210180052260 |
12 | 158482432b0b7 |
13 | 74513c950117 |
14 | 3366cd250c55 |
15 | 17c129b45621 |
hex | bf5df8010cb |
13150644605131 has 64 divisors (see below), whose sum is σ = 15146302574592. Its totient is φ = 11309414400000.
The previous prime is 13150644605101. The next prime is 13150644605173.
It is a happy number.
13150644605131 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13150644605131 - 215 = 13150644572363 is a prime.
It is a super-2 number, since 2×131506446051312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13150644605101) 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 63 ways as a sum of consecutive naturals, for example, 1446551896 + ... + 1446560986.
It is an arithmetic number, because the mean of its divisors is an integer number (236660977728).
Almost surely, 213150644605131 is an apocalyptic number.
13150644605131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13150644605131 is a deficient number, since it is larger than the sum of its proper divisors (1995657969461).
13150644605131 is a wasteful number, since it uses less digits than its factorization.
13150644605131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9764.
The product of its (nonzero) digits is 129600, while the sum is 40.
The spelling of 13150644605131 in words is "thirteen trillion, one hundred fifty billion, six hundred forty-four million, six hundred five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •