Base | Representation |
---|---|
bin | 110000000001001111… |
… | …1110010000011001000 |
3 | 100212011200112200221001 |
4 | 1200002133302003020 |
5 | 3142143000213000 |
6 | 115212335024344 |
7 | 10310302616221 |
oct | 1400237620310 |
9 | 325150480831 |
10 | 103121101000 |
11 | 3a80819a515 |
12 | 17b9b06b0b4 |
13 | 9955315078 |
14 | 4dc378c248 |
15 | 2a3825046a |
hex | 18027f20c8 |
103121101000 has 64 divisors (see below), whose sum is σ = 243692757360. Its totient is φ = 40840000000.
The previous prime is 103121100961. The next prime is 103121101001. The reversal of 103121101000 is 101121301.
It can be written as a sum of positive squares in 8 ways, for example, as 41834157156 + 61286943844 = 204534^2 + 247562^2 .
It is a super-2 number, since 2×1031211010002 (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 (103121101001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 409501 + ... + 611500.
Almost surely, 2103121101000 is an apocalyptic number.
103121101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103121101000 is an abundant number, since it is smaller than the sum of its proper divisors (140571656360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103121101000 is a wasteful number, since it uses less digits than its factorization.
103121101000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1021123 (or 1021109 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 103121101000 its reverse (101121301), we get a palindrome (103222222301).
The spelling of 103121101000 in words is "one hundred three billion, one hundred twenty-one million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •