Base | Representation |
---|---|
bin | 10001100001010010… |
… | …11110011001111001 |
3 | 220021112021001212102 |
4 | 20300221132121321 |
5 | 123230431112101 |
6 | 4153205353145 |
7 | 452043434066 |
oct | 106051363171 |
9 | 26245231772 |
10 | 9406113401 |
11 | 3a97562243 |
12 | 19a61087b5 |
13 | b6b952399 |
14 | 65332bc6d |
15 | 3a0b9b86b |
hex | 230a5e679 |
9406113401 has 8 divisors (see below), whose sum is σ = 9421800000. Its totient is φ = 9390442320.
The previous prime is 9406113383. The next prime is 9406113439. The reversal of 9406113401 is 1043116049.
9406113401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9406113401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9406113701) 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 7 ways as a sum of consecutive naturals, for example, 1879100 + ... + 1884098.
It is an arithmetic number, because the mean of its divisors is an integer number (1177725000).
Almost surely, 29406113401 is an apocalyptic number.
It is an amenable number.
9406113401 is a deficient number, since it is larger than the sum of its proper divisors (15686599).
9406113401 is a wasteful number, since it uses less digits than its factorization.
9406113401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7759.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 9406113401 is about 96985.1194823206. The cubic root of 9406113401 is about 2110.9117149655.
The spelling of 9406113401 in words is "nine billion, four hundred six million, one hundred thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •