Base | Representation |
---|---|
bin | 10010001111011001100000… |
… | …11100001110010001011001 |
3 | 12021000121211020221212212110 |
4 | 21013230300130032101121 |
5 | 20224141334121012301 |
6 | 221150550243302533 |
7 | 11306650444565133 |
oct | 1107546034162131 |
9 | 167017736855773 |
10 | 40111512282201 |
11 | 11865218a84188 |
12 | 45b9a6837aa49 |
13 | 194c6651971b9 |
14 | 9c959c47c053 |
15 | 4985d49880d6 |
hex | 247b3070e459 |
40111512282201 has 16 divisors (see below), whose sum is σ = 56458168424000. Its totient is φ = 25260997618368.
The previous prime is 40111512282113. The next prime is 40111512282203. The reversal of 40111512282201 is 10228221511104.
It is not a de Polignac number, because 40111512282201 - 29 = 40111512281689 is a prime.
It is a super-3 number, since 3×401115122822013 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40111512282203) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1008161686 + ... + 1008201471.
It is an arithmetic number, because the mean of its divisors is an integer number (3528635526500).
Almost surely, 240111512282201 is an apocalyptic number.
It is an amenable number.
40111512282201 is a deficient number, since it is larger than the sum of its proper divisors (16346656141799).
40111512282201 is a wasteful number, since it uses less digits than its factorization.
40111512282201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2016363528.
The product of its (nonzero) digits is 2560, while the sum is 30.
Adding to 40111512282201 its reverse (10228221511104), we get a palindrome (50339733793305).
The spelling of 40111512282201 in words is "forty trillion, one hundred eleven billion, five hundred twelve million, two hundred eighty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •