Base | Representation |
---|---|
bin | 101111000100110011001101… |
… | …1001110011111011101001001 |
3 | 2000022010021210210122001210022 |
4 | 1132021212123032133131021 |
5 | 413233210331203314101 |
6 | 4024355534232230225 |
7 | 153135003632253146 |
oct | 13611463316373511 |
9 | 2008107723561708 |
10 | 414076106307401 |
11 | 10aa3476608349a |
12 | 3a53688223b375 |
13 | 14a08294a26795 |
14 | 74375676913cd |
15 | 32d110a773a1b |
hex | 178999b39f749 |
414076106307401 has 8 divisors (see below), whose sum is σ = 432079731679104. Its totient is φ = 396072507302560.
The previous prime is 414076106307361. The next prime is 414076106307419. The reversal of 414076106307401 is 104703601670414.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-414076106307401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (414076106307421) 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, 29766956 + ... + 41403186.
It is an arithmetic number, because the mean of its divisors is an integer number (54009966459888).
Almost surely, 2414076106307401 is an apocalyptic number.
It is an amenable number.
414076106307401 is a deficient number, since it is larger than the sum of its proper divisors (18003625371703).
414076106307401 is a wasteful number, since it uses less digits than its factorization.
414076106307401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13183431.
The product of its (nonzero) digits is 338688, while the sum is 44.
Adding to 414076106307401 its reverse (104703601670414), we get a palindrome (518779707977815).
The spelling of 414076106307401 in words is "four hundred fourteen trillion, seventy-six billion, one hundred six million, three hundred seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •