Base | Representation |
---|---|
bin | 110000010000101110… |
… | …0001100101000101100 |
3 | 100220111212102110100201 |
4 | 1200201130030220230 |
5 | 3144223401130040 |
6 | 115340042203244 |
7 | 10326205426621 |
oct | 1404134145054 |
9 | 326455373321 |
10 | 103640255020 |
11 | 3aa54249625 |
12 | 18104ab3524 |
13 | 9a08a454b3 |
14 | 50326cc348 |
15 | 2a68aeda9a |
hex | 182170ca2c |
103640255020 has 48 divisors (see below), whose sum is σ = 218976196320. Its totient is φ = 41202855936.
The previous prime is 103640255011. The next prime is 103640255021. The reversal of 103640255020 is 20552046301.
It is a super-3 number, since 3×1036402550203 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 103640255020.
It is not an unprimeable number, because it can be changed into a prime (103640255021) 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, 4322826 + ... + 4346734.
It is an arithmetic number, because the mean of its divisors is an integer number (4562004090).
Almost surely, 2103640255020 is an apocalyptic number.
103640255020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103640255020 is an abundant number, since it is smaller than the sum of its proper divisors (115335941300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103640255020 is a wasteful number, since it uses less digits than its factorization.
103640255020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25234 (or 25232 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The spelling of 103640255020 in words is "one hundred three billion, six hundred forty million, two hundred fifty-five thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •