Base | Representation |
---|---|
bin | 101111000011001110… |
… | …1100011110010001111 |
3 | 100122210122212002220011 |
4 | 1132012131203302033 |
5 | 3123412234043003 |
6 | 114230040534051 |
7 | 10204604022565 |
oct | 1360635436217 |
9 | 318718762804 |
10 | 101040143503 |
11 | 3993a588332 |
12 | 176ba181327 |
13 | 96b3163880 |
14 | 4c6725ba35 |
15 | 29656ea46d |
hex | 1786763c8f |
101040143503 has 8 divisors (see below), whose sum is σ = 109480025648. Its totient is φ = 92695627584.
The previous prime is 101040143471. The next prime is 101040143507. The reversal of 101040143503 is 305341040101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101040143503 - 25 = 101040143471 is a prime.
It is a super-2 number, since 2×1010401435032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101040143507) 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, 23839350 + ... + 23843587.
It is an arithmetic number, because the mean of its divisors is an integer number (13685003206).
Almost surely, 2101040143503 is an apocalyptic number.
101040143503 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
101040143503 is a deficient number, since it is larger than the sum of its proper divisors (8439882145).
101040143503 is a wasteful number, since it uses less digits than its factorization.
101040143503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47683113.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 101040143503 its reverse (305341040101), we get a palindrome (406381183604).
The spelling of 101040143503 in words is "one hundred one billion, forty million, one hundred forty-three thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •