Base | Representation |
---|---|
bin | 10011010010011011011001… |
… | …11111100111100100111111 |
3 | 12120011210120112111222220202 |
4 | 21221031230333213210333 |
5 | 21024410130422231021 |
6 | 230113002355234115 |
7 | 11635233042044300 |
oct | 1151155477474477 |
9 | 176153515458822 |
10 | 42414630664511 |
11 | 12572a42299026 |
12 | 49102a5ba893b |
13 | 1a888b46201b1 |
14 | a68c442907a7 |
15 | 4d847dc9ea0b |
hex | 26936cfe793f |
42414630664511 has 12 divisors (see below), whose sum is σ = 52241789991168. Its totient is φ = 34216844905152.
The previous prime is 42414630664487. The next prime is 42414630664531. The reversal of 42414630664511 is 11546603641424.
It is not a de Polignac number, because 42414630664511 - 26 = 42414630664447 is a prime.
It is a super-3 number, since 3×424146306645113 (a number of 42 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42414630664531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25458961151 + ... + 25458962816.
It is an arithmetic number, because the mean of its divisors is an integer number (4353482499264).
Almost surely, 242414630664511 is an apocalyptic number.
42414630664511 is a deficient number, since it is larger than the sum of its proper divisors (9827159326657).
42414630664511 is a wasteful number, since it uses less digits than its factorization.
42414630664511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50917923998 (or 50917923991 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 47.
The spelling of 42414630664511 in words is "forty-two trillion, four hundred fourteen billion, six hundred thirty million, six hundred sixty-four thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •