Base | Representation |
---|---|
bin | 101101110001010011010001… |
… | …011100011110010000100000 |
3 | 222101202002120222101011222102 |
4 | 231301103101130132100200 |
5 | 202341044441012143130 |
6 | 1552043543502425532 |
7 | 60254306450514605 |
oct | 5561232134362040 |
9 | 871662528334872 |
10 | 201300041131040 |
11 | 5915a960378935 |
12 | 1a6b13685922a8 |
13 | 8842687a578c7 |
14 | 379cd8c8386ac |
15 | 18414218db645 |
hex | b714d171e420 |
201300041131040 has 96 divisors (see below), whose sum is σ = 480237311970864. Its totient is φ = 79732943257600.
The previous prime is 201300041131009. The next prime is 201300041131099. The reversal of 201300041131040 is 40131140003102.
It can be written as a sum of positive squares in 8 ways, for example, as 90910809200656 + 110389231930384 = 9534716^2 + 10506628^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2660699 + ... + 20240538.
Almost surely, 2201300041131040 is an apocalyptic number.
201300041131040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201300041131040 is an abundant number, since it is smaller than the sum of its proper divisors (278937270839824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201300041131040 is a wasteful number, since it uses less digits than its factorization.
201300041131040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22901790 (or 22901782 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 201300041131040 its reverse (40131140003102), we get a palindrome (241431181134142).
The spelling of 201300041131040 in words is "two hundred one trillion, three hundred billion, forty-one million, one hundred thirty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •