Base | Representation |
---|---|
bin | 1100000100000101101… |
… | …10010101000011010101 |
3 | 1110121221001201111021001 |
4 | 12002002312111003111 |
5 | 23242410101444001 |
6 | 514231345423301 |
7 | 41642666026354 |
oct | 6020266250325 |
9 | 1417831644231 |
10 | 414512140501 |
11 | 14a88032a348 |
12 | 6840333ab31 |
13 | 3011c093224 |
14 | 160c36b199b |
15 | abb0992001 |
hex | 6082d950d5 |
414512140501 has 4 divisors (see below), whose sum is σ = 427883499904. Its totient is φ = 401140781100.
The previous prime is 414512140481. The next prime is 414512140529. The reversal of 414512140501 is 105041215414.
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 414512140501 - 225 = 414478586069 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 414512140501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414512140571) 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, 6685679655 + ... + 6685679716.
It is an arithmetic number, because the mean of its divisors is an integer number (106970874976).
Almost surely, 2414512140501 is an apocalyptic number.
It is an amenable number.
414512140501 is a deficient number, since it is larger than the sum of its proper divisors (13371359403).
414512140501 is a wasteful number, since it uses less digits than its factorization.
414512140501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13371359402.
The product of its (nonzero) digits is 3200, while the sum is 28.
Adding to 414512140501 its reverse (105041215414), we get a palindrome (519553355915).
The spelling of 414512140501 in words is "four hundred fourteen billion, five hundred twelve million, one hundred forty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •