Base | Representation |
---|---|
bin | 11110011110011011001111… |
… | …011110111110101111100001 |
3 | 122120120100121120222012001011 |
4 | 132132123033132332233201 |
5 | 120031441001443202001 |
6 | 1153021320122140521 |
7 | 40142336422030621 |
oct | 3636331736765741 |
9 | 576510546865034 |
10 | 134032230444001 |
11 | 3978582796647a |
12 | 13048416951741 |
13 | 59a3253876456 |
14 | 25152a1c6a881 |
15 | 1076744daed51 |
hex | 79e6cf7bebe1 |
134032230444001 has 4 divisors (see below), whose sum is σ = 136032711495472. Its totient is φ = 132031749392532.
The previous prime is 134032230443989. The next prime is 134032230444031. The reversal of 134032230444001 is 100444032230431.
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 134032230444001 - 237 = 133894791490529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134032230444031) 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, 1000240525635 + ... + 1000240525768.
It is an arithmetic number, because the mean of its divisors is an integer number (34008177873868).
Almost surely, 2134032230444001 is an apocalyptic number.
It is an amenable number.
134032230444001 is a deficient number, since it is larger than the sum of its proper divisors (2000481051471).
134032230444001 is an equidigital number, since it uses as much as digits as its factorization.
134032230444001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2000481051470.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 134032230444001 its reverse (100444032230431), we get a palindrome (234476262674432).
The spelling of 134032230444001 in words is "one hundred thirty-four trillion, thirty-two billion, two hundred thirty million, four hundred forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •