Base | Representation |
---|---|
bin | 10010101111000101010110… |
… | …10110100001101010001000 |
3 | 12101212200220212001200100221 |
4 | 21113202223112201222020 |
5 | 20400011002441042300 |
6 | 223343035555235424 |
7 | 11451421251135514 |
oct | 1127425326415210 |
9 | 171780825050327 |
10 | 41200201112200 |
11 | 121449a8493799 |
12 | 4754a5bba8b74 |
13 | 19cb215738a70 |
14 | a261595d5144 |
15 | 4b6aa23d131a |
hex | 2578ab5a1a88 |
41200201112200 has 96 divisors (see below), whose sum is σ = 103170069583560. Its totient is φ = 15210744422400.
The previous prime is 41200201112137. The next prime is 41200201112281. The reversal of 41200201112200 is 221110200214.
It can be written as a sum of positive squares in 12 ways, for example, as 113357462596 + 41086843649604 = 336686^2 + 6409902^2 .
It is a super-2 number, since 2×412002011122002 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23438392 + ... + 25134808.
Almost surely, 241200201112200 is an apocalyptic number.
41200201112200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41200201112200 is an abundant number, since it is smaller than the sum of its proper divisors (61969868471360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41200201112200 is a wasteful number, since it uses less digits than its factorization.
41200201112200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1705787 (or 1705778 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 41200201112200 its reverse (221110200214), we get a palindrome (41421311312414).
The spelling of 41200201112200 in words is "forty-one trillion, two hundred billion, two hundred one million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •