Base | Representation |
---|---|
bin | 11001000011101000110001… |
… | …011111011010111001110100 |
3 | 112110012010022012221021102011 |
4 | 121003220301133122321310 |
5 | 103421013323401413022 |
6 | 1030213404220254004 |
7 | 32132524006521253 |
oct | 3103506137327164 |
9 | 473163265837364 |
10 | 110201101201012 |
11 | 3212802a766a78 |
12 | 104398659a1304 |
13 | 4964bc47a1b63 |
14 | 1d2da9439479a |
15 | cb18b46a8977 |
hex | 643a317dae74 |
110201101201012 has 12 divisors (see below), whose sum is σ = 203002028528320. Its totient is φ = 52200521621496.
The previous prime is 110201101201001. The next prime is 110201101201109. The reversal of 110201101201012 is 210102101102011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110201101200983 and 110201101201001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 725007244668 + ... + 725007244819.
Almost surely, 2110201101201012 is an apocalyptic number.
It is an amenable number.
110201101201012 is a deficient number, since it is larger than the sum of its proper divisors (92800927327308).
110201101201012 is a wasteful number, since it uses less digits than its factorization.
110201101201012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1450014489510 (or 1450014489508 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110201101201012 its reverse (210102101102011), we get a palindrome (320303202303023).
Subtracting 110201101201012 from its reverse (210102101102011), we obtain a palindrome (99900999900999).
The spelling of 110201101201012 in words is "one hundred ten trillion, two hundred one billion, one hundred one million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •