Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1011101100010010010 |
3 | 101112110002121221110102 |
4 | 1212220133131202102 |
5 | 3301142424032010 |
6 | 122343045532402 |
7 | 10650612030332 |
oct | 1465037354222 |
9 | 345402557412 |
10 | 110201002130 |
11 | 42810657a7a |
12 | 19436114102 |
13 | a51304538b |
14 | 5495b870c2 |
15 | 2ceea9dba5 |
hex | 19a87dd892 |
110201002130 has 16 divisors (see below), whose sum is σ = 210030145560. Its totient is φ = 41487436032.
The previous prime is 110201002103. The next prime is 110201002139. The reversal of 110201002130 is 31200102011.
It can be written as a sum of positive squares in 4 ways, for example, as 81054659401 + 29146342729 = 284701^2 + 170723^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110201002139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 324120425 + ... + 324120764.
Almost surely, 2110201002130 is an apocalyptic number.
110201002130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110201002130 is a deficient number, since it is larger than the sum of its proper divisors (99829143430).
110201002130 is a wasteful number, since it uses less digits than its factorization.
110201002130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648241213.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 110201002130 its reverse (31200102011), we get a palindrome (141401104141).
The spelling of 110201002130 in words is "one hundred ten billion, two hundred one million, two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •