Base | Representation |
---|---|
bin | 10111011011010100001111… |
… | …100010010000001100010000 |
3 | 111111210210012100002101120201 |
4 | 113123110033202100030100 |
5 | 102001040002130214300 |
6 | 1003044204210344544 |
7 | 30462555510220402 |
oct | 2733241742201420 |
9 | 444723170071521 |
10 | 103032231101200 |
11 | 2a9137a6459275 |
12 | b68040588b154 |
13 | 4564b8933b85b |
14 | 1b62b025a8b72 |
15 | bda18894e66a |
hex | 5db50f890310 |
103032231101200 has 120 divisors (see below), whose sum is σ = 252223407258048. Its totient is φ = 40432404579840.
The previous prime is 103032231101179. The next prime is 103032231101279. The reversal of 103032231101200 is 2101132230301.
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, 309926269 + ... + 310258531.
Almost surely, 2103032231101200 is an apocalyptic number.
103032231101200 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 103032231101200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126111703629024).
103032231101200 is an abundant number, since it is smaller than the sum of its proper divisors (149191176156848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103032231101200 is a wasteful number, since it uses less digits than its factorization.
103032231101200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346961 (or 346950 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103032231101200 its reverse (2101132230301), we get a palindrome (105133363331501).
The spelling of 103032231101200 in words is "one hundred three trillion, thirty-two billion, two hundred thirty-one million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •