Base | Representation |
---|---|
bin | 10011000011100001… |
… | …11001000011010101 |
3 | 222101221211000102100 |
4 | 21201300321003111 |
5 | 131422404004031 |
6 | 4411043232313 |
7 | 511340523243 |
oct | 114160710325 |
9 | 28357730370 |
10 | 10230141141 |
11 | 437a714500 |
12 | 1b96078699 |
13 | c70598a6c |
14 | 6d094d793 |
15 | 3ed1bcde6 |
hex | 261c390d5 |
10230141141 has 36 divisors (see below), whose sum is σ = 16294780684. Its totient is φ = 6180071040.
The previous prime is 10230141133. The next prime is 10230141151. The reversal of 10230141141 is 14114103201.
10230141141 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 19847025 + 10210294116 = 4455^2 + 101046^2 .
It is not a de Polignac number, because 10230141141 - 23 = 10230141133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230141121) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 325851 + ... + 355863.
Almost surely, 210230141141 is an apocalyptic number.
10230141141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10230141141 is a deficient number, since it is larger than the sum of its proper divisors (6064639543).
10230141141 is a wasteful number, since it uses less digits than its factorization.
10230141141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30354 (or 30340 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 10230141141 its reverse (14114103201), we get a palindrome (24344244342).
The spelling of 10230141141 in words is "ten billion, two hundred thirty million, one hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •