Base | Representation |
---|---|
bin | 10010110100000001101010… |
… | …11000100101011111100001 |
3 | 12102110221020212110010221120 |
4 | 21122000311120211133201 |
5 | 20410301300240220140 |
6 | 223553043005042453 |
7 | 11466612451220103 |
oct | 1132006530453741 |
9 | 172427225403846 |
10 | 41370020632545 |
11 | 121aaa22150920 |
12 | 4781954256429 |
13 | 1a1123a181847 |
14 | a304692cb573 |
15 | 4bb1e0e7b1d0 |
hex | 25a0356257e1 |
41370020632545 has 32 divisors (see below), whose sum is σ = 74699473000320. Its totient is φ = 19366530032640.
The previous prime is 41370020632541. The next prime is 41370020632571. The reversal of 41370020632545 is 54523602007314.
It is not a de Polignac number, because 41370020632545 - 22 = 41370020632541 is a prime.
It is a super-2 number, since 2×413700206325452 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41370020632497 and 41370020632506.
It is not an unprimeable number, because it can be changed into a prime (41370020632541) 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, 4322881384 + ... + 4322890953.
It is an arithmetic number, because the mean of its divisors is an integer number (2334358531260).
Almost surely, 241370020632545 is an apocalyptic number.
It is an amenable number.
41370020632545 is a deficient number, since it is larger than the sum of its proper divisors (33329452367775).
41370020632545 is a wasteful number, since it uses less digits than its factorization.
41370020632545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8645772385.
The product of its (nonzero) digits is 604800, while the sum is 42.
Adding to 41370020632545 its reverse (54523602007314), we get a palindrome (95893622639859).
The spelling of 41370020632545 in words is "forty-one trillion, three hundred seventy billion, twenty million, six hundred thirty-two thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •