Base | Representation |
---|---|
bin | 11110100110110111100010… |
… | …000101111000011000101111 |
3 | 122122121211001001010111211001 |
4 | 132212313202011320120233 |
5 | 120120442104440411211 |
6 | 1154144022124541131 |
7 | 40232264564160442 |
oct | 3646674205703057 |
9 | 578554031114731 |
10 | 134612363216431 |
11 | 39989867775931 |
12 | 131209400b17a7 |
13 | 5a15b784a56a9 |
14 | 25353b770b659 |
15 | 108689a98bac1 |
hex | 7a6de217862f |
134612363216431 has 4 divisors (see below), whose sum is σ = 134612386805952. Its totient is φ = 134612339626912.
The previous prime is 134612363216417. The next prime is 134612363216447.
It is a happy number.
134612363216431 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 134612363216431 - 211 = 134612363214383 is a prime.
It is a super-2 number, since 2×1346123632164312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134612363213431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2713986 + ... + 16631008.
It is an arithmetic number, because the mean of its divisors is an integer number (33653096701488).
Almost surely, 2134612363216431 is an apocalyptic number.
134612363216431 is a deficient number, since it is larger than the sum of its proper divisors (23589521).
134612363216431 is an equidigital number, since it uses as much as digits as its factorization.
134612363216431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23589520.
The product of its digits is 1119744, while the sum is 46.
The spelling of 134612363216431 in words is "one hundred thirty-four trillion, six hundred twelve billion, three hundred sixty-three million, two hundred sixteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •