Base | Representation |
---|---|
bin | 110000000001100100… |
… | …1111001011010111000 |
3 | 100212012110022121021211 |
4 | 1200003021321122320 |
5 | 3142203312004430 |
6 | 115213411412504 |
7 | 10310465510422 |
oct | 1400311713270 |
9 | 325173277254 |
10 | 103132141240 |
11 | 3a813450187 |
12 | 17ba28b4134 |
13 | 99576ac25b |
14 | 4dc5023812 |
15 | 2a391d172a |
hex | 18032796b8 |
103132141240 has 64 divisors (see below), whose sum is σ = 235963647360. Its totient is φ = 40557265920.
The previous prime is 103132141213. The next prime is 103132141261. The reversal of 103132141240 is 42141231301.
It is a congruent number.
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, 5805652 + ... + 5823388.
It is an arithmetic number, because the mean of its divisors is an integer number (3686931990).
Almost surely, 2103132141240 is an apocalyptic number.
103132141240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103132141240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117981823680).
103132141240 is an abundant number, since it is smaller than the sum of its proper divisors (132831506120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103132141240 is a wasteful number, since it uses less digits than its factorization.
103132141240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20192 (or 20188 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 103132141240 its reverse (42141231301), we get a palindrome (145273372541).
The spelling of 103132141240 in words is "one hundred three billion, one hundred thirty-two million, one hundred forty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •