Base | Representation |
---|---|
bin | 111010010111100010001… |
… | …111111001011100000110 |
3 | 112012110002111201010010012 |
4 | 322113202033321130012 |
5 | 1011204012034233124 |
6 | 12310343400430222 |
7 | 562533220030304 |
oct | 72274217713406 |
9 | 15173074633105 |
10 | 4011000305414 |
11 | 1307068118973 |
12 | 549437a78372 |
13 | 23130aacc0ab |
14 | dc1c228d274 |
15 | 6e506aa9e0e |
hex | 3a5e23f9706 |
4011000305414 has 8 divisors (see below), whose sum is σ = 6074913084240. Its totient is φ = 1986029277336.
The previous prime is 4011000305407. The next prime is 4011000305419. The reversal of 4011000305414 is 4145030001104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×40110003054142 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4011000305414.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4011000305419) 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, 9735437429 + ... + 9735437840.
It is an arithmetic number, because the mean of its divisors is an integer number (759364135530).
Almost surely, 24011000305414 is an apocalyptic number.
4011000305414 is a deficient number, since it is larger than the sum of its proper divisors (2063912778826).
4011000305414 is a wasteful number, since it uses less digits than its factorization.
4011000305414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19470875374.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 4011000305414 its reverse (4145030001104), we get a palindrome (8156030306518).
The spelling of 4011000305414 in words is "four trillion, eleven billion, three hundred five thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •