Base | Representation |
---|---|
bin | 10011011111000010000011… |
… | …11100011010100001111001 |
3 | 12121201012101220001210220112 |
4 | 21233201001330122201321 |
5 | 21104004042211214431 |
6 | 231043543420234105 |
7 | 12011433644366300 |
oct | 1157410174324171 |
9 | 177635356053815 |
10 | 42847700101241 |
11 | 1271a675740722 |
12 | 498020809b935 |
13 | 1aba6a020a179 |
14 | a81ba83bb437 |
15 | 4e48789cec2b |
hex | 26f841f1a879 |
42847700101241 has 12 divisors (see below), whose sum is σ = 49844980644480. Its totient is φ = 36725319698760.
The previous prime is 42847700101187. The next prime is 42847700101307. The reversal of 42847700101241 is 14210100774824.
42847700101241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42847700101241 - 26 = 42847700101177 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (42847700101441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13821521 + ... + 16635198.
It is an arithmetic number, because the mean of its divisors is an integer number (4153748387040).
Almost surely, 242847700101241 is an apocalyptic number.
It is an amenable number.
42847700101241 is a deficient number, since it is larger than the sum of its proper divisors (6997280543239).
42847700101241 is a wasteful number, since it uses less digits than its factorization.
42847700101241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30485444 (or 30485437 counting only the distinct ones).
The product of its (nonzero) digits is 100352, while the sum is 41.
The spelling of 42847700101241 in words is "forty-two trillion, eight hundred forty-seven billion, seven hundred million, one hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •