Base | Representation |
---|---|
bin | 111100110011110… |
… | …1111010010100011 |
3 | 12021012111010112022 |
4 | 1321213233102203 |
5 | 13134324213301 |
6 | 534250052055 |
7 | 101364425201 |
oct | 17147572243 |
9 | 5235433468 |
10 | 2040460451 |
11 | 957872157 |
12 | 48b41a02b |
13 | 266972663 |
14 | 154dcc071 |
15 | be205d1b |
hex | 799ef4a3 |
2040460451 has 4 divisors (see below), whose sum is σ = 2043448632. Its totient is φ = 2037472272.
The previous prime is 2040460441. The next prime is 2040460493. The reversal of 2040460451 is 1540640402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2040460451 - 222 = 2036266147 is a prime.
It is a super-3 number, since 3×20404604513 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2040460451.
It is not an unprimeable number, because it can be changed into a prime (2040460441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1493066 + ... + 1494431.
It is an arithmetic number, because the mean of its divisors is an integer number (510862158).
Almost surely, 22040460451 is an apocalyptic number.
2040460451 is a deficient number, since it is larger than the sum of its proper divisors (2988181).
2040460451 is an equidigital number, since it uses as much as digits as its factorization.
2040460451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2988180.
The product of its (nonzero) digits is 3840, while the sum is 26.
The square root of 2040460451 is about 45171.4561531948. The cubic root of 2040460451 is about 1268.3605544792.
The spelling of 2040460451 in words is "two billion, forty million, four hundred sixty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •