Base | Representation |
---|---|
bin | 1100000011001100011… |
… | …10110110100111111001 |
3 | 1110120200121022100202002 |
4 | 12001212032312213321 |
5 | 23240414144431301 |
6 | 514111555150345 |
7 | 41625046122026 |
oct | 6014616664771 |
9 | 1416617270662 |
10 | 414032030201 |
11 | 14a654318379 |
12 | 682aa5a53b5 |
13 | 300737832aa |
14 | 16079a1654d |
15 | ab8375716b |
hex | 60663b69f9 |
414032030201 has 4 divisors (see below), whose sum is σ = 414046191732. Its totient is φ = 414017868672.
The previous prime is 414032030147. The next prime is 414032030213. The reversal of 414032030201 is 102030230414.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 183920899600 + 230111130601 = 428860^2 + 479699^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-414032030201 is a prime.
It is a super-2 number, since 2×4140320302012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (414032030221) 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, 7036820 + ... + 7095413.
It is an arithmetic number, because the mean of its divisors is an integer number (103511547933).
Almost surely, 2414032030201 is an apocalyptic number.
It is an amenable number.
414032030201 is a deficient number, since it is larger than the sum of its proper divisors (14161531).
414032030201 is a wasteful number, since it uses less digits than its factorization.
414032030201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14161530.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 414032030201 its reverse (102030230414), we get a palindrome (516062260615).
The spelling of 414032030201 in words is "four hundred fourteen billion, thirty-two million, thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •