Base | Representation |
---|---|
bin | 10111011011000001100000… |
… | …001111000111000100101100 |
3 | 111111201212021002001202121200 |
4 | 113123001200033013010230 |
5 | 102000222300202414012 |
6 | 1003031035441525500 |
7 | 30461244056333226 |
oct | 2733014017070454 |
9 | 444655232052550 |
10 | 103012110201132 |
11 | 2a906210763240 |
12 | b67852b343890 |
13 | 45630008b3422 |
14 | 1b61b54211416 |
15 | bd98ac2a13dc |
hex | 5db0603c712c |
103012110201132 has 144 divisors (see below), whose sum is σ = 290126224507392. Its totient is φ = 30549664506240.
The previous prime is 103012110201131. The next prime is 103012110201211. The reversal of 103012110201132 is 231102011210301.
103012110201132 is a `hidden beast` number, since 1 + 0 + 301 + 21 + 10 + 201 + 132 = 666.
It is a super-2 number, since 2×1030121102011322 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (103012110201131) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 303820363 + ... + 304159229.
It is an arithmetic number, because the mean of its divisors is an integer number (2014765447968).
Almost surely, 2103012110201132 is an apocalyptic number.
103012110201132 is a gapful number since it is divisible by the number (12) 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 103012110201132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145063112253696).
103012110201132 is an abundant number, since it is smaller than the sum of its proper divisors (187114114306260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103012110201132 is a wasteful number, since it uses less digits than its factorization.
103012110201132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355268 (or 355263 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 103012110201132 its reverse (231102011210301), we get a palindrome (334114121411433).
The spelling of 103012110201132 in words is "one hundred three trillion, twelve billion, one hundred ten million, two hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •