Base | Representation |
---|---|
bin | 11110100011010001011100… |
… | …101100010111111011101111 |
3 | 122121202012100121201121122011 |
4 | 132203101130230113323233 |
5 | 120102420124334234203 |
6 | 1153434323332302051 |
7 | 40205400455532253 |
oct | 3643213454277357 |
9 | 577665317647564 |
10 | 134365312024303 |
11 | 398a4010817688 |
12 | 130a0a93171927 |
13 | 59c8796316139 |
14 | 252745c7b8263 |
15 | 108023b9a376d |
hex | 7a345cb17eef |
134365312024303 has 16 divisors (see below), whose sum is σ = 138670355552256. Its totient is φ = 130122172314400.
The previous prime is 134365312024247. The next prime is 134365312024309. The reversal of 134365312024303 is 303420213563431.
It is a cyclic number.
It is not a de Polignac number, because 134365312024303 - 221 = 134365309927151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134365312024309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1425901 + ... + 16454902.
It is an arithmetic number, because the mean of its divisors is an integer number (8666897222016).
Almost surely, 2134365312024303 is an apocalyptic number.
134365312024303 is a deficient number, since it is larger than the sum of its proper divisors (4305043527953).
134365312024303 is a wasteful number, since it uses less digits than its factorization.
134365312024303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17882534.
The product of its (nonzero) digits is 466560, while the sum is 40.
Adding to 134365312024303 its reverse (303420213563431), we get a palindrome (437785525587734).
The spelling of 134365312024303 in words is "one hundred thirty-four trillion, three hundred sixty-five billion, three hundred twelve million, twenty-four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •