Base | Representation |
---|---|
bin | 10011100000001111000… |
… | …01100111010101000100 |
3 | 2101001202021210200111022 |
4 | 21300013201213111010 |
5 | 41434422113304112 |
6 | 1231505242330312 |
7 | 66262502536160 |
oct | 11600741472504 |
9 | 2331667720438 |
10 | 670141150532 |
11 | 2392292330a7 |
12 | a9a64ab9998 |
13 | 4b26a3c5a89 |
14 | 2461391dca0 |
15 | 12672a60d72 |
hex | 9c07867544 |
670141150532 has 12 divisors (see below), whose sum is σ = 1340282301120. Its totient is φ = 287203350216.
The previous prime is 670141150531. The next prime is 670141150583. The reversal of 670141150532 is 235051141076.
It is a happy number.
670141150532 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 670141150492 and 670141150501.
It is not an unprimeable number, because it can be changed into a prime (670141150531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11966806232 + ... + 11966806287.
It is an arithmetic number, because the mean of its divisors is an integer number (111690191760).
Almost surely, 2670141150532 is an apocalyptic number.
It is an amenable number.
670141150532 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.
670141150532 is a wasteful number, since it uses less digits than its factorization.
670141150532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23933612530 (or 23933612528 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 35.
The spelling of 670141150532 in words is "six hundred seventy billion, one hundred forty-one million, one hundred fifty thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •