Base | Representation |
---|---|
bin | 10011100011110101… |
… | …01100001010011001 |
3 | 1000002211202110011020 |
4 | 21301322230022121 |
5 | 133001243121431 |
6 | 4454003553053 |
7 | 521141155536 |
oct | 116172541231 |
9 | 30084673136 |
10 | 10501145241 |
11 | 44a9693934 |
12 | 205098b789 |
13 | cb4783912 |
14 | 718935d8d |
15 | 416da0696 |
hex | 271eac299 |
10501145241 has 8 divisors (see below), whose sum is σ = 14111775744. Its totient is φ = 6945639120.
The previous prime is 10501145219. The next prime is 10501145273. The reversal of 10501145241 is 14254110501.
10501145241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10501145241 - 29 = 10501144729 is a prime.
It is a super-2 number, since 2×105011452412 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10501145041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13780650 + ... + 13781411.
It is an arithmetic number, because the mean of its divisors is an integer number (1763971968).
Almost surely, 210501145241 is an apocalyptic number.
It is an amenable number.
10501145241 is a deficient number, since it is larger than the sum of its proper divisors (3610630503).
10501145241 is a wasteful number, since it uses less digits than its factorization.
10501145241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27562191.
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 10501145241 its reverse (14254110501), we get a palindrome (24755255742).
The spelling of 10501145241 in words is "ten billion, five hundred one million, one hundred forty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •