Base | Representation |
---|---|
bin | 10011010111111101… |
… | …10111000011100101 |
3 | 222211220101202122202 |
4 | 21223332313003211 |
5 | 132300300401031 |
6 | 4440045504245 |
7 | 515521633646 |
oct | 115376670345 |
9 | 28756352582 |
10 | 10401575141 |
11 | 44584663a1 |
12 | 2023572085 |
13 | c99c609b9 |
14 | 7096176cd |
15 | 40d2832cb |
hex | 26bfb70e5 |
10401575141 has 4 divisors (see below), whose sum is σ = 10402740000. Its totient is φ = 10400410284.
The previous prime is 10401575113. The next prime is 10401575153. The reversal of 10401575141 is 14157510401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14157510401 = 20611 ⋅686891.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10401575141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10401575741) 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, 568931 + ... + 586928.
It is an arithmetic number, because the mean of its divisors is an integer number (2600685000).
Almost surely, 210401575141 is an apocalyptic number.
It is an amenable number.
10401575141 is a deficient number, since it is larger than the sum of its proper divisors (1164859).
10401575141 is an equidigital number, since it uses as much as digits as its factorization.
10401575141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1164858.
The product of its (nonzero) digits is 2800, while the sum is 29.
The spelling of 10401575141 in words is "ten billion, four hundred one million, five hundred seventy-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •