Base | Representation |
---|---|
bin | 10111011111101010110011… |
… | …111000001000110111010000 |
3 | 111112212101020211012220000210 |
4 | 113133222303320020313100 |
5 | 102020440041301421300 |
6 | 1003433432430444120 |
7 | 30523304646621432 |
oct | 2737526370106720 |
9 | 445771224186023 |
10 | 103331341045200 |
11 | 2aa196371a52a4 |
12 | b70a381063640 |
13 | 4587146945cb8 |
14 | 1b7339941c652 |
15 | be2d42de8050 |
hex | 5dfab3e08dd0 |
103331341045200 has 120 divisors (see below), whose sum is σ = 335194662736000. Its totient is φ = 27206226478080.
The previous prime is 103331341045147. The next prime is 103331341045213. The reversal of 103331341045200 is 2540143133301.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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, 544901725 + ... + 545091324.
Almost surely, 2103331341045200 is an apocalyptic number.
103331341045200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103331341045200 is an abundant number, since it is smaller than the sum of its proper divisors (231863321690800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103331341045200 is a wasteful number, since it uses less digits than its factorization.
103331341045200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1089993149 (or 1089993138 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 103331341045200 its reverse (2540143133301), we get a palindrome (105871484178501).
The spelling of 103331341045200 in words is "one hundred three trillion, three hundred thirty-one billion, three hundred forty-one million, forty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •