Base | Representation |
---|---|
bin | 111010011010011011001… |
… | …100001010111011011010 |
3 | 112012202002202012002112202 |
4 | 322122123030022323122 |
5 | 1011231340344112214 |
6 | 12312015320410202 |
7 | 563003134331651 |
oct | 72323314127332 |
9 | 15182082162482 |
10 | 4014103113434 |
11 | 130840a618517 |
12 | 549b63016962 |
13 | 2316b389b27b |
14 | dc3d83b8198 |
15 | 6e6391aa6de |
hex | 3a69b30aeda |
4014103113434 has 8 divisors (see below), whose sum is σ = 6149264344128. Its totient is φ = 1964348332060.
The previous prime is 4014103113409. The next prime is 4014103113439. The reversal of 4014103113434 is 4343113014104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×40141031134342 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4014103113397 and 4014103113406.
It is not an unprimeable number, because it can be changed into a prime (4014103113439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21351612212 + ... + 21351612399.
It is an arithmetic number, because the mean of its divisors is an integer number (768658043016).
Almost surely, 24014103113434 is an apocalyptic number.
4014103113434 is a deficient number, since it is larger than the sum of its proper divisors (2135161230694).
4014103113434 is a wasteful number, since it uses less digits than its factorization.
4014103113434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42703224660.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 4014103113434 its reverse (4343113014104), we get a palindrome (8357216127538).
The spelling of 4014103113434 in words is "four trillion, fourteen billion, one hundred three million, one hundred thirteen thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •