Base | Representation |
---|---|
bin | 100111010000000011… |
… | …101100000110001001 |
3 | 11000210011212210000000 |
4 | 213100003230012021 |
5 | 1142303201134031 |
6 | 31210012433213 |
7 | 3021254265555 |
oct | 472003540611 |
9 | 130704783000 |
10 | 42145333641 |
11 | 16967a3aa54 |
12 | 8202478809 |
13 | 3c88683858 |
14 | 207b498865 |
15 | 116a0063e6 |
hex | 9d00ec189 |
42145333641 has 32 divisors (see below), whose sum is σ = 66926563200. Its totient is φ = 26444107584.
The previous prime is 42145333603. The next prime is 42145333693. The reversal of 42145333641 is 14633354124.
42145333641 is a `hidden beast` number, since 4 + 2 + 1 + 4 + 5 + 3 + 3 + 3 + 641 = 666.
It is not a de Polignac number, because 42145333641 - 26 = 42145333577 is a prime.
It is a super-2 number, since 2×421453336412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42145333596 and 42145333605.
It is not an unprimeable number, because it can be changed into a prime (42145333541) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 529611 + ... + 603968.
It is an arithmetic number, because the mean of its divisors is an integer number (2091455100).
Almost surely, 242145333641 is an apocalyptic number.
It is an amenable number.
42145333641 is a deficient number, since it is larger than the sum of its proper divisors (24781229559).
42145333641 is an equidigital number, since it uses as much as digits as its factorization.
42145333641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1133617 (or 1133599 counting only the distinct ones).
The product of its digits is 103680, while the sum is 36.
Adding to 42145333641 its reverse (14633354124), we get a palindrome (56778687765).
The spelling of 42145333641 in words is "forty-two billion, one hundred forty-five million, three hundred thirty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •