Base | Representation |
---|---|
bin | 11110100101011010010000… |
… | …000101100011001010110001 |
3 | 122122021020111201021221201001 |
4 | 132211122100011203022301 |
5 | 120112321443001300001 |
6 | 1154030015243042001 |
7 | 40222120534515115 |
oct | 3645322005431261 |
9 | 578236451257631 |
10 | 134512203150001 |
11 | 39950339a52526 |
12 | 13105448810301 |
13 | 5a095a57811b1 |
14 | 25305d5301745 |
15 | 1083e87685001 |
hex | 7a56901632b1 |
134512203150001 has 4 divisors (see below), whose sum is σ = 134561820343104. Its totient is φ = 134462585956900.
The previous prime is 134512203149977. The next prime is 134512203150007. The reversal of 134512203150001 is 100051302215431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 134512203150001 - 213 = 134512203141809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134512203150007) 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, 24808592485 + ... + 24808597906.
It is an arithmetic number, because the mean of its divisors is an integer number (33640455085776).
Almost surely, 2134512203150001 is an apocalyptic number.
It is an amenable number.
134512203150001 is a deficient number, since it is larger than the sum of its proper divisors (49617193103).
134512203150001 is an equidigital number, since it uses as much as digits as its factorization.
134512203150001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49617193102.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 134512203150001 its reverse (100051302215431), we get a palindrome (234563505365432).
The spelling of 134512203150001 in words is "one hundred thirty-four trillion, five hundred twelve billion, two hundred three million, one hundred fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.280 sec. • engine limits •