Base | Representation |
---|---|
bin | 11001000010001101100110… |
… | …001011111010011111000100 |
3 | 112102211202121101111101221102 |
4 | 121002031212023322133010 |
5 | 103412412323431012012 |
6 | 1030100413504035232 |
7 | 32122456651024340 |
oct | 3102154613723704 |
9 | 472752541441842 |
10 | 110103201032132 |
11 | 3209a5616640a0 |
12 | 104228a3302b18 |
13 | 49588c2021449 |
14 | 1d29048178620 |
15 | cae0849a12c2 |
hex | 6423662fa7c4 |
110103201032132 has 96 divisors (see below), whose sum is σ = 245343980851200. Its totient is φ = 41983333816320.
The previous prime is 110103201032119. The next prime is 110103201032191. The reversal of 110103201032132 is 231230102301011.
It is a happy number.
It is a super-2 number, since 2×1101032010321322 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 554317028 + ... + 554515620.
It is an arithmetic number, because the mean of its divisors is an integer number (2555666467200).
Almost surely, 2110103201032132 is an apocalyptic number.
It is an amenable number.
110103201032132 is an abundant number, since it is smaller than the sum of its proper divisors (135240779819068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110103201032132 is a wasteful number, since it uses less digits than its factorization.
110103201032132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236961 (or 236959 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 110103201032132 its reverse (231230102301011), we get a palindrome (341333303333143).
The spelling of 110103201032132 in words is "one hundred ten trillion, one hundred three billion, two hundred one million, thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •