Base | Representation |
---|---|
bin | 101111000111011001111000… |
… | …1110100010011000110010001 |
3 | 2000100101111200220112220120112 |
4 | 1132032303301310103012101 |
5 | 413310041404041010101 |
6 | 4025232211550251105 |
7 | 153202604614004111 |
oct | 13616636164230621 |
9 | 2010344626486515 |
10 | 414434041344401 |
11 | 11006254307a561 |
12 | 3a594115ab6a95 |
13 | 14a32c68541270 |
14 | 744aa00d1b041 |
15 | 32da5a923e6bb |
hex | 178ecf1d13191 |
414434041344401 has 8 divisors (see below), whose sum is σ = 446343635957184. Its totient is φ = 382528740013200.
The previous prime is 414434041344319. The next prime is 414434041344409. The reversal of 414434041344401 is 104443140434414.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 414434041344401 - 234 = 414416861475217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (414434041344409) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1073119901 + ... + 1073506026.
It is an arithmetic number, because the mean of its divisors is an integer number (55792954494648).
Almost surely, 2414434041344401 is an apocalyptic number.
It is an amenable number.
414434041344401 is a deficient number, since it is larger than the sum of its proper divisors (31909594612783).
414434041344401 is a wasteful number, since it uses less digits than its factorization.
414434041344401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2146640791.
The product of its (nonzero) digits is 589824, while the sum is 41.
Adding to 414434041344401 its reverse (104443140434414), we get a palindrome (518877181778815).
The spelling of 414434041344401 in words is "four hundred fourteen trillion, four hundred thirty-four billion, forty-one million, three hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •