Base | Representation |
---|---|
bin | 11110011110010100100010… |
… | …011011110111010001110011 |
3 | 122120112200000221012120102210 |
4 | 132132110202123313101303 |
5 | 120031331231220420311 |
6 | 1153014125542543203 |
7 | 40141663145003445 |
oct | 3636244233672163 |
9 | 576480027176383 |
10 | 134025032201331 |
11 | 3978277371a197 |
12 | 13046b48137b03 |
13 | 59a267748006b |
14 | 2514bbbc68495 |
15 | 1076472e873a6 |
hex | 79e5226f7473 |
134025032201331 has 4 divisors (see below), whose sum is σ = 178700042935112. Its totient is φ = 89350021467552.
The previous prime is 134025032201321. The next prime is 134025032201339. The reversal of 134025032201331 is 133102230520431.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 134025032201331 - 210 = 134025032200307 is a prime.
It is a super-2 number, since 2×1340250322013312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134025032201339) 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, 22337505366886 + ... + 22337505366891.
It is an arithmetic number, because the mean of its divisors is an integer number (44675010733778).
Almost surely, 2134025032201331 is an apocalyptic number.
134025032201331 is a deficient number, since it is larger than the sum of its proper divisors (44675010733781).
134025032201331 is an equidigital number, since it uses as much as digits as its factorization.
134025032201331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44675010733780.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 134025032201331 its reverse (133102230520431), we get a palindrome (267127262721762).
The spelling of 134025032201331 in words is "one hundred thirty-four trillion, twenty-five billion, thirty-two million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.360 sec. • engine limits •