Base | Representation |
---|---|
bin | 111010110010110101000… |
… | …010101110100010100101 |
3 | 112022020201220202122010101 |
4 | 322302311002232202211 |
5 | 1012144022000234003 |
6 | 12332031413224101 |
7 | 564621364606060 |
oct | 72626502564245 |
9 | 15266656678111 |
10 | 4040306649253 |
11 | 1318536855846 |
12 | 553056632031 |
13 | 233ccb566454 |
14 | dd7a25318d7 |
15 | 7016e86611d |
hex | 3acb50ae8a5 |
4040306649253 has 4 divisors (see below), whose sum is σ = 4617493313440. Its totient is φ = 3463119985068.
The previous prime is 4040306649209. The next prime is 4040306649287. The reversal of 4040306649253 is 3529466030404.
4040306649253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4040306649253 - 217 = 4040306518181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4040306649853) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 288593332083 + ... + 288593332096.
It is an arithmetic number, because the mean of its divisors is an integer number (1154373328360).
Almost surely, 24040306649253 is an apocalyptic number.
It is an amenable number.
4040306649253 is a deficient number, since it is larger than the sum of its proper divisors (577186664187).
4040306649253 is an equidigital number, since it uses as much as digits as its factorization.
4040306649253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 577186664186.
The product of its (nonzero) digits is 1866240, while the sum is 46.
The spelling of 4040306649253 in words is "four trillion, forty billion, three hundred six million, six hundred forty-nine thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •