Base | Representation |
---|---|
bin | 11100100011010011001… |
… | …10000100100010100001 |
3 | 10110210012020222102011201 |
4 | 32101221212010202201 |
5 | 112033114134144413 |
6 | 2030402023441201 |
7 | 130606456346326 |
oct | 16215146044241 |
9 | 3423166872151 |
10 | 981024131233 |
11 | 349060601923 |
12 | 13a166bb6201 |
13 | 71682b29a23 |
14 | 356a6190b4d |
15 | 1a7ba8969dd |
hex | e4699848a1 |
981024131233 has 8 divisors (see below), whose sum is σ = 1007747037440. Its totient is φ = 954312211440.
The previous prime is 981024131221. The next prime is 981024131239. The reversal of 981024131233 is 332131420189.
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 981024131233 - 221 = 981022034081 is a prime.
It is a super-2 number, since 2×9810241312332 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 981024131192 and 981024131201.
It is not an unprimeable number, because it can be changed into a prime (981024131239) 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, 2565423 + ... + 2922916.
It is an arithmetic number, because the mean of its divisors is an integer number (125968379680).
Almost surely, 2981024131233 is an apocalyptic number.
It is an amenable number.
981024131233 is a deficient number, since it is larger than the sum of its proper divisors (26722906207).
981024131233 is a wasteful number, since it uses less digits than its factorization.
981024131233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5493207.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 981024131233 in words is "nine hundred eighty-one billion, twenty-four million, one hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •