Base | Representation |
---|---|
bin | 110100001010110000… |
… | …1010011010010101000 |
3 | 101201011120120212120201 |
4 | 1220111201103102220 |
5 | 3313414212413000 |
6 | 123244352001544 |
7 | 11044132665544 |
oct | 1502541232250 |
9 | 351146525521 |
10 | 112030201000 |
11 | 4356a145183 |
12 | 198668302b4 |
13 | a744cb9883 |
14 | 55caaa0a24 |
15 | 2daa47396a |
hex | 1a158534a8 |
112030201000 has 32 divisors (see below), whose sum is σ = 262150672680. Its totient is φ = 44812080000.
The previous prime is 112030200979. The next prime is 112030201001. The reversal of 112030201000 is 102030211.
It can be written as a sum of positive squares in 4 ways, for example, as 52493224996 + 59536976004 = 229114^2 + 244002^2 .
It is a super-2 number, since 2×1120302010002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (112030201001) 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, 56014101 + ... + 56016100.
Almost surely, 2112030201000 is an apocalyptic number.
112030201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112030201000 is an abundant number, since it is smaller than the sum of its proper divisors (150120471680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112030201000 is a wasteful number, since it uses less digits than its factorization.
112030201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112030222 (or 112030208 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 112030201000 its reverse (102030211), we get a palindrome (112132231211).
The spelling of 112030201000 in words is "one hundred twelve billion, thirty million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •