Base | Representation |
---|---|
bin | 1111101001011101… |
… | …0000100001110101 |
3 | 101211201210110221220 |
4 | 3322113100201311 |
5 | 32100300313023 |
6 | 1532445100553 |
7 | 206042551044 |
oct | 37227204165 |
9 | 11751713856 |
10 | 4200401013 |
11 | 18660204a6 |
12 | 992857759 |
13 | 51c2b93b3 |
14 | 2bbbdc55b |
15 | 198b5d3e3 |
hex | fa5d0875 |
4200401013 has 32 divisors (see below), whose sum is σ = 6007115520. Its totient is φ = 2604771840.
The previous prime is 4200401011. The next prime is 4200401033. The reversal of 4200401013 is 3101040024.
It is not a de Polignac number, because 4200401013 - 21 = 4200401011 is a prime.
It is a super-2 number, since 2×42004010132 = 35286737340022852338, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4200400983 and 4200401001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4200401011) 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 31 ways as a sum of consecutive naturals, for example, 368995 + ... + 380207.
It is an arithmetic number, because the mean of its divisors is an integer number (187722360).
Almost surely, 24200401013 is an apocalyptic number.
It is an amenable number.
4200401013 is a deficient number, since it is larger than the sum of its proper divisors (1806714507).
4200401013 is a wasteful number, since it uses less digits than its factorization.
4200401013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11389.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 4200401013 is about 64810.5007926956. The cubic root of 4200401013 is about 1613.4799940619.
Adding to 4200401013 its reverse (3101040024), we get a palindrome (7301441037).
The spelling of 4200401013 in words is "four billion, two hundred million, four hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •