Base | Representation |
---|---|
bin | 101010111011000… |
… | …0001101010010101 |
3 | 10201101001001120112 |
4 | 1111312001222111 |
5 | 10422144212231 |
6 | 354525012405 |
7 | 50455501310 |
oct | 12566015225 |
9 | 3641031515 |
10 | 1440225941 |
11 | 679a74080 |
12 | 3423b4105 |
13 | 19c4c40cb |
14 | d93c3977 |
15 | 8668d92b |
hex | 55d81a95 |
1440225941 has 16 divisors (see below), whose sum is σ = 1901232000. Its totient is φ = 1056238080.
The previous prime is 1440225911. The next prime is 1440225947. The reversal of 1440225941 is 1495220441.
It is a cyclic number.
It is not a de Polignac number, because 1440225941 - 222 = 1436031637 is a prime.
It is a super-2 number, since 2×14402259412 = 4148501522258670962, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1440225898 and 1440225907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1440225947) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 548816 + ... + 551433.
It is an arithmetic number, because the mean of its divisors is an integer number (118827000).
Almost surely, 21440225941 is an apocalyptic number.
1440225941 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1440225941 is a deficient number, since it is larger than the sum of its proper divisors (461006059).
1440225941 is a wasteful number, since it uses less digits than its factorization.
1440225941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100284.
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 1440225941 is about 37950.3088393230. The cubic root of 1440225941 is about 1129.3022922967.
The spelling of 1440225941 in words is "one billion, four hundred forty million, two hundred twenty-five thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •