Base | Representation |
---|---|
bin | 10111011111010111000111… |
… | …111100111001100101111100 |
3 | 111112210100200200020222220201 |
4 | 113133113013330321211330 |
5 | 102020113243432014322 |
6 | 1003420015125053244 |
7 | 30521626065331144 |
oct | 2737270774714574 |
9 | 445710620228821 |
10 | 103310203001212 |
11 | 2aa1067a336a59 |
12 | b706261b57224 |
13 | 458515855a26c |
14 | 1b72351d33924 |
15 | be25072cdd27 |
hex | 5df5c7f3997c |
103310203001212 has 12 divisors (see below), whose sum is σ = 180795821781456. Its totient is φ = 51654253920800.
The previous prime is 103310203001143. The next prime is 103310203001219. The reversal of 103310203001212 is 212100302013301.
It is a self number, because there is not a number n which added to its sum of digits gives 103310203001212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103310203001219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 211620664 + ... + 212108287.
It is an arithmetic number, because the mean of its divisors is an integer number (15066318481788).
Almost surely, 2103310203001212 is an apocalyptic number.
It is an amenable number.
103310203001212 is a deficient number, since it is larger than the sum of its proper divisors (77485618780244).
103310203001212 is a wasteful number, since it uses less digits than its factorization.
103310203001212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423789908 (or 423789906 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103310203001212 its reverse (212100302013301), we get a palindrome (315410505014513).
The spelling of 103310203001212 in words is "one hundred three trillion, three hundred ten billion, two hundred three million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •