Base | Representation |
---|---|
bin | 10100000000011111… |
… | …00111011110111100 |
3 | 1000201121001100112101 |
4 | 22000033213132330 |
5 | 133444311341444 |
6 | 4533511514444 |
7 | 530120226610 |
oct | 120017473674 |
9 | 30647040471 |
10 | 10741512124 |
11 | 4612338052 |
12 | 20b9388a24 |
13 | 1022502745 |
14 | 73c825340 |
15 | 42d0303d4 |
hex | 2803e77bc |
10741512124 has 12 divisors (see below), whose sum is σ = 21483024304. Its totient is φ = 4603505184.
The previous prime is 10741512109. The next prime is 10741512127. The reversal of 10741512124 is 42121514701.
10741512124 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 383625433 = 10741512124 / (1 + 0 + 7 + 4 + 1 + 5 + 1 + 2 + 1 + 2 + 4).
It is a junction number, because it is equal to n+sod(n) for n = 10741512092 and 10741512101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10741512127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 191812689 + ... + 191812744.
Almost surely, 210741512124 is an apocalyptic number.
10741512124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10741512124 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10741512124 is a wasteful number, since it uses less digits than its factorization.
10741512124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 383625444 (or 383625442 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 28.
The spelling of 10741512124 in words is "ten billion, seven hundred forty-one million, five hundred twelve thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •