Base | Representation |
---|---|
bin | 111100110011100… |
… | …1001011100001101 |
3 | 12021012012020212110 |
4 | 1321213021130031 |
5 | 13134304233141 |
6 | 534242454233 |
7 | 101363211210 |
oct | 17147113415 |
9 | 5235166773 |
10 | 2040305421 |
11 | 957776730 |
12 | 48b364379 |
13 | 266919c1b |
14 | 154d8b777 |
15 | be1c4e16 |
hex | 799c970d |
2040305421 has 16 divisors (see below), whose sum is σ = 3391676928. Its totient is φ = 1059898800.
The previous prime is 2040305401. The next prime is 2040305431. The reversal of 2040305421 is 1245030402.
It is not a de Polignac number, because 2040305421 - 213 = 2040297229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2040305401) 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 15 ways as a sum of consecutive naturals, for example, 4416015 + ... + 4416476.
It is an arithmetic number, because the mean of its divisors is an integer number (211979808).
Almost surely, 22040305421 is an apocalyptic number.
2040305421 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2040305421 is a deficient number, since it is larger than the sum of its proper divisors (1351371507).
2040305421 is a wasteful number, since it uses less digits than its factorization.
2040305421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8832512.
The product of its (nonzero) digits is 960, while the sum is 21.
The square root of 2040305421 is about 45169.7401033037. The cubic root of 2040305421 is about 1268.3284311878.
Adding to 2040305421 its reverse (1245030402), we get a palindrome (3285335823).
The spelling of 2040305421 in words is "two billion, forty million, three hundred five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •