Base | Representation |
---|---|
bin | 1000001011110011… |
… | …11101101001010001 |
3 | 102100020011202210112 |
4 | 10011321331221101 |
5 | 32444334014311 |
6 | 2004003411105 |
7 | 213613535543 |
oct | 40571755121 |
9 | 12306152715 |
10 | 4394048081 |
11 | 19553643a5 |
12 | a27683a95 |
13 | 55045ab67 |
14 | 2d9809693 |
15 | 1aab6028b |
hex | 105e7da51 |
4394048081 has 4 divisors (see below), whose sum is σ = 4396919664. Its totient is φ = 4391176500.
The previous prime is 4394048077. The next prime is 4394048111. The reversal of 4394048081 is 1808404934.
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 4394048081 - 22 = 4394048077 is a prime.
It is a super-2 number, since 2×43940480812 = 38615317076279565122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4394048011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1433495 + ... + 1436556.
It is an arithmetic number, because the mean of its divisors is an integer number (1099229916).
Almost surely, 24394048081 is an apocalyptic number.
It is an amenable number.
4394048081 is a deficient number, since it is larger than the sum of its proper divisors (2871583).
4394048081 is a wasteful number, since it uses less digits than its factorization.
4394048081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2871582.
The product of its (nonzero) digits is 110592, while the sum is 41.
The square root of 4394048081 is about 66287.6163472485. The cubic root of 4394048081 is about 1637.9033390293.
The spelling of 4394048081 in words is "four billion, three hundred ninety-four million, forty-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •