Base | Representation |
---|---|
bin | 110010000010010010111101… |
… | …1110110010100111010011101 |
3 | 2010201100002022202112110120201 |
4 | 1210010211323312110322131 |
5 | 430141412243424441023 |
6 | 4200020242405543501 |
7 | 161463432241300054 |
oct | 14404457366247235 |
9 | 2121302282473521 |
10 | 440120261562013 |
11 | 118265a5581623a |
12 | 41442309114b91 |
13 | 15b7721625caa6 |
14 | 7a97d11ab539b |
15 | 35d3810c6abad |
hex | 190497bd94e9d |
440120261562013 has 8 divisors (see below), whose sum is σ = 454412477258496. Its totient is φ = 425833970109600.
The previous prime is 440120261561989. The next prime is 440120261562043. The reversal of 440120261562013 is 310265162021044.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 440120261562013 - 233 = 440111671627421 is a prime.
It is a super-2 number, since 2×4401202615620132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (440120261562043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1480910023 + ... + 1481207188.
It is an arithmetic number, because the mean of its divisors is an integer number (56801559657312).
Almost surely, 2440120261562013 is an apocalyptic number.
It is an amenable number.
440120261562013 is a deficient number, since it is larger than the sum of its proper divisors (14292215696483).
440120261562013 is a wasteful number, since it uses less digits than its factorization.
440120261562013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2962122035.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 440120261562013 in words is "four hundred forty trillion, one hundred twenty billion, two hundred sixty-one million, five hundred sixty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •