Base | Representation |
---|---|
bin | 101100100101100… |
… | …1000110101001101 |
3 | 10212021011100101010 |
4 | 1121023020311031 |
5 | 11030444420411 |
6 | 404242235433 |
7 | 52034400126 |
oct | 13113106515 |
9 | 3767140333 |
10 | 1496091981 |
11 | 6a856105a |
12 | 359055b79 |
13 | 1aac54537 |
14 | 1029a704d |
15 | 8b5267a6 |
hex | 592c8d4d |
1496091981 has 8 divisors (see below), whose sum is σ = 1996483104. Its totient is φ = 996547760.
The previous prime is 1496091973. The next prime is 1496092001. The reversal of 1496091981 is 1891906941.
It is a happy number.
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 1496091981 - 23 = 1496091973 is a prime.
It is a super-3 number, since 3×14960919813 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1496091981.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1496091911) 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, 207591 + ... + 214676.
It is an arithmetic number, because the mean of its divisors is an integer number (249560388).
Almost surely, 21496091981 is an apocalyptic number.
It is an amenable number.
1496091981 is a deficient number, since it is larger than the sum of its proper divisors (500391123).
1496091981 is a wasteful number, since it uses less digits than its factorization.
1496091981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423451.
The product of its (nonzero) digits is 139968, while the sum is 48.
The square root of 1496091981 is about 38679.3482494212. The cubic root of 1496091981 is about 1143.7192523969.
The spelling of 1496091981 in words is "one billion, four hundred ninety-six million, ninety-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •