Base | Representation |
---|---|
bin | 1101111100101011000100001… |
… | …1110101001000000011111111 |
3 | 11202201012220000100211022020121 |
4 | 3133022301003311020003333 |
5 | 2012121431143023214411 |
6 | 13355252454122155411 |
7 | 413511225104200156 |
oct | 33712610365100377 |
9 | 4681186010738217 |
10 | 981504244351231 |
11 | 26481268119a887 |
12 | 920ba121652b67 |
13 | 331885b75c4183 |
14 | 134530b788459d |
15 | 78712a0250571 |
hex | 37cac43d480ff |
981504244351231 has 8 divisors (see below), whose sum is σ = 1052655991956720. Its totient is φ = 912301859693952.
The previous prime is 981504244351219. The next prime is 981504244351237. The reversal of 981504244351231 is 132153442405189.
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 981504244351231 - 221 = 981504242254079 is a prime.
It is a super-2 number, since 2×9815042443512312 (a number of 31 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 (981504244351237) 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, 487340736010 + ... + 487340738023.
It is an arithmetic number, because the mean of its divisors is an integer number (131581998994590).
Almost surely, 2981504244351231 is an apocalyptic number.
981504244351231 is a deficient number, since it is larger than the sum of its proper divisors (71151747605489).
981504244351231 is a wasteful number, since it uses less digits than its factorization.
981504244351231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974681474105.
The product of its (nonzero) digits is 4147200, while the sum is 52.
The spelling of 981504244351231 in words is "nine hundred eighty-one trillion, five hundred four billion, two hundred forty-four million, three hundred fifty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •