Base | Representation |
---|---|
bin | 111110100111101101… |
… | …0000010011110110111 |
3 | 110212002212201101100001 |
4 | 1331033122002132313 |
5 | 4200401402242101 |
6 | 141435535532131 |
7 | 12500305641361 |
oct | 1751732023667 |
9 | 425085641301 |
10 | 134476212151 |
11 | 52038352616 |
12 | 2208b98a047 |
13 | c8b136ca88 |
14 | 6719b81d31 |
15 | 3770d03901 |
hex | 1f4f6827b7 |
134476212151 has 4 divisors (see below), whose sum is σ = 134486214192. Its totient is φ = 134466210112.
The previous prime is 134476212149. The next prime is 134476212181. The reversal of 134476212151 is 151212674431.
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 134476212151 - 21 = 134476212149 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134476212151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134476212121) 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 3 ways as a sum of consecutive naturals, for example, 4980826 + ... + 5007751.
It is an arithmetic number, because the mean of its divisors is an integer number (33621553548).
Almost surely, 2134476212151 is an apocalyptic number.
134476212151 is a deficient number, since it is larger than the sum of its proper divisors (10002041).
134476212151 is an equidigital number, since it uses as much as digits as its factorization.
134476212151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10002040.
The product of its digits is 40320, while the sum is 37.
Adding to 134476212151 its reverse (151212674431), we get a palindrome (285688886582).
The spelling of 134476212151 in words is "one hundred thirty-four billion, four hundred seventy-six million, two hundred twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •