Base | Representation |
---|---|
bin | 100110011001100000… |
… | …111000110011111101 |
3 | 10221102101222020220202 |
4 | 212121200320303331 |
5 | 1133414420203041 |
6 | 30535123053245 |
7 | 2656503160214 |
oct | 463140706375 |
9 | 127371866822 |
10 | 41230241021 |
11 | 1653843a362 |
12 | 7ba7b11225 |
13 | 3b70c04628 |
14 | 1dd1b3007b |
15 | 11149e7a9b |
hex | 999838cfd |
41230241021 has 16 divisors (see below), whose sum is σ = 43023052800. Its totient is φ = 39463032000.
The previous prime is 41230241011. The next prime is 41230241033. The reversal of 41230241021 is 12014203214.
It is a cyclic number.
It is not a de Polignac number, because 41230241021 - 230 = 40156499197 is a prime.
It is a super-2 number, since 2×412302410212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41230240984 and 41230241002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41230241011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2818436 + ... + 2833026.
It is an arithmetic number, because the mean of its divisors is an integer number (2688940800).
Almost surely, 241230241021 is an apocalyptic number.
It is an amenable number.
41230241021 is a deficient number, since it is larger than the sum of its proper divisors (1792811779).
41230241021 is a wasteful number, since it uses less digits than its factorization.
41230241021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15460.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 41230241021 its reverse (12014203214), we get a palindrome (53244444235).
The spelling of 41230241021 in words is "forty-one billion, two hundred thirty million, two hundred forty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •