Base | Representation |
---|---|
bin | 11001011101001100110… |
… | …10000110110001101010 |
3 | 10002121200021100001122210 |
4 | 30232212122012301222 |
5 | 103312311034104232 |
6 | 1505452402225550 |
7 | 120123100135362 |
oct | 14564632066152 |
9 | 3077607301583 |
10 | 874670222442 |
11 | 307a445a1035 |
12 | 1216253552b6 |
13 | 64633b2a153 |
14 | 304973179a2 |
15 | 17b439175cc |
hex | cba6686c6a |
874670222442 has 8 divisors (see below), whose sum is σ = 1749340444896. Its totient is φ = 291556740812.
The previous prime is 874670222423. The next prime is 874670222443. The reversal of 874670222442 is 244222076478.
It is a happy number.
874670222442 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
874670222442 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 874670222391 and 874670222400.
It is not an unprimeable number, because it can be changed into a prime (874670222443) 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, 72889185198 + ... + 72889185209.
It is an arithmetic number, because the mean of its divisors is an integer number (218667555612).
Almost surely, 2874670222442 is an apocalyptic number.
874670222442 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.
874670222442 is a wasteful number, since it uses less digits than its factorization.
874670222442 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145778370412.
The product of its (nonzero) digits is 2408448, while the sum is 48.
The spelling of 874670222442 in words is "eight hundred seventy-four billion, six hundred seventy million, two hundred twenty-two thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •