Base | Representation |
---|---|
bin | 11010110011100100111… |
… | …00101111000011100110 |
3 | 10021001101002011012002020 |
4 | 31121302130233003212 |
5 | 110042244020333432 |
6 | 1543042114524010 |
7 | 123354210326301 |
oct | 15316234570346 |
9 | 3231332135066 |
10 | 921043136742 |
11 | 3256809259a3 |
12 | 12a607596606 |
13 | 68b142c5401 |
14 | 32816047b38 |
15 | 18e59b4a22c |
hex | d67272f0e6 |
921043136742 has 8 divisors (see below), whose sum is σ = 1842086273496. Its totient is φ = 307014378912.
The previous prime is 921043136719. The next prime is 921043136743. The reversal of 921043136742 is 247631340129.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
921043136742 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 921043136694 and 921043136703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (921043136743) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76753594723 + ... + 76753594734.
It is an arithmetic number, because the mean of its divisors is an integer number (230260784187).
Almost surely, 2921043136742 is an apocalyptic number.
921043136742 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
921043136742 is a wasteful number, since it uses less digits than its factorization.
921043136742 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153507189462.
The product of its (nonzero) digits is 217728, while the sum is 42.
It can be divided in two parts, 921043 and 136742, that added together give a triangular number (1057785 = T1454).
The spelling of 921043136742 in words is "nine hundred twenty-one billion, forty-three million, one hundred thirty-six thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •