Base | Representation |
---|---|
bin | 110000000111000000… |
… | …1010101001110011100 |
3 | 100212200011100121022210 |
4 | 1200032001111032130 |
5 | 3143041444221322 |
6 | 115243443040420 |
7 | 10315141203036 |
oct | 1401601251634 |
9 | 325604317283 |
10 | 103314445212 |
11 | 3a8a7346920 |
12 | 18033970110 |
13 | 99863aba24 |
14 | 500131ac56 |
15 | 2a4a1e270c |
hex | 180e05539c |
103314445212 has 24 divisors (see below), whose sum is σ = 262982224512. Its totient is φ = 31307407600.
The previous prime is 103314445193. The next prime is 103314445217. The reversal of 103314445212 is 212544413301.
It is a self number, because there is not a number n which added to its sum of digits gives 103314445212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103314445217) 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, 391342464 + ... + 391342727.
It is an arithmetic number, because the mean of its divisors is an integer number (10957592688).
Almost surely, 2103314445212 is an apocalyptic number.
103314445212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103314445212 is an abundant number, since it is smaller than the sum of its proper divisors (159667779300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103314445212 is a wasteful number, since it uses less digits than its factorization.
103314445212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782685209 (or 782685207 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 103314445212 its reverse (212544413301), we get a palindrome (315858858513).
The spelling of 103314445212 in words is "one hundred three billion, three hundred fourteen million, four hundred forty-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •