Base | Representation |
---|---|
bin | 11110100001010100011101… |
… | …000011010010101010000001 |
3 | 122121021100221011200210220112 |
4 | 132201110131003102222001 |
5 | 120043220243134212001 |
6 | 1153252525521321105 |
7 | 40162606540661051 |
oct | 3641243503225201 |
9 | 577240834623815 |
10 | 134231100304001 |
11 | 398520a97a6778 |
12 | 1307aa77a96195 |
13 | 59b8c279c101c |
14 | 2520b69c05561 |
15 | 107b9d3ee7cbb |
hex | 7a151d0d2a81 |
134231100304001 has 4 divisors (see below), whose sum is σ = 134231150926272. Its totient is φ = 134231049681732.
The previous prime is 134231100303983. The next prime is 134231100304003. The reversal of 134231100304001 is 100403001132431.
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 a de Polignac number, because none of the positive numbers 2k-134231100304001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134231100304003) 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, 21100181 + ... + 26714786.
It is an arithmetic number, because the mean of its divisors is an integer number (33557787731568).
Almost surely, 2134231100304001 is an apocalyptic number.
It is an amenable number.
134231100304001 is a deficient number, since it is larger than the sum of its proper divisors (50622271).
134231100304001 is an equidigital number, since it uses as much as digits as its factorization.
134231100304001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50622270.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 134231100304001 its reverse (100403001132431), we get a palindrome (234634101436432).
The spelling of 134231100304001 in words is "one hundred thirty-four trillion, two hundred thirty-one billion, one hundred million, three hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •