Base | Representation |
---|---|
bin | 110000000000111010… |
… | …1011100000110001000 |
3 | 100212010220122202122010 |
4 | 1200001311130012020 |
5 | 3142132130013112 |
6 | 115211301055520 |
7 | 10310106355623 |
oct | 1400165340610 |
9 | 325126582563 |
10 | 103110001032 |
11 | 3a8019a8995 |
12 | 17b973b75a0 |
13 | 9952c2993c |
14 | 4dc20dcdba |
15 | 2a372ab63c |
hex | 1801d5c188 |
103110001032 has 32 divisors (see below), whose sum is σ = 257785152480. Its totient is φ = 34368647040.
The previous prime is 103110000949. The next prime is 103110001069. The reversal of 103110001032 is 230100011301.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 103110000999 and 103110001017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 677932 + ... + 815972.
It is an arithmetic number, because the mean of its divisors is an integer number (8055786015).
Almost surely, 2103110001032 is an apocalyptic number.
103110001032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103110001032 is an abundant number, since it is smaller than the sum of its proper divisors (154675151448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103110001032 is a wasteful number, since it uses less digits than its factorization.
103110001032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169173 (or 169169 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 103110001032 its reverse (230100011301), we get a palindrome (333210012333).
The spelling of 103110001032 in words is "one hundred three billion, one hundred ten million, one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •