Base | Representation |
---|---|
bin | 110000000001100010… |
… | …1111011010000110100 |
3 | 100212012101100201021020 |
4 | 1200003011323100310 |
5 | 3142203030201322 |
6 | 115213333221140 |
7 | 10310453613360 |
oct | 1400305732064 |
9 | 325171321236 |
10 | 103131100212 |
11 | 3a8128aa028 |
12 | 17ba24917b0 |
13 | 995740646a |
14 | 4dc4c322a0 |
15 | 2a3907805c |
hex | 180317b434 |
103131100212 has 24 divisors (see below), whose sum is σ = 275016267456. Its totient is φ = 29466028608.
The previous prime is 103131100199. The next prime is 103131100213. The reversal of 103131100212 is 212001131301.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 103131100191 and 103131100200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103131100213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 613875513 + ... + 613875680.
It is an arithmetic number, because the mean of its divisors is an integer number (11459011144).
Almost surely, 2103131100212 is an apocalyptic number.
103131100212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103131100212 is an abundant number, since it is smaller than the sum of its proper divisors (171885167244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103131100212 is a wasteful number, since it uses less digits than its factorization.
103131100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1227751207 (or 1227751205 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103131100212 its reverse (212001131301), we get a palindrome (315132231513).
The spelling of 103131100212 in words is "one hundred three billion, one hundred thirty-one million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •