Base | Representation |
---|---|
bin | 1001011110101110101101… |
… | …1010000000110111010101 |
3 | 1100220110222102200212210220 |
4 | 2113223223122000313111 |
5 | 2331234402233001031 |
6 | 34100301435504553 |
7 | 2124035020120623 |
oct | 227535332006725 |
9 | 40813872625726 |
10 | 10423540125141 |
11 | 33596647288a0 |
12 | 120419a5b8159 |
13 | 5a7c217195a0 |
14 | 28070581c513 |
15 | 13121828d596 |
hex | 97aeb680dd5 |
10423540125141 has 32 divisors (see below), whose sum is σ = 16707499049472. Its totient is φ = 5695738292160.
The previous prime is 10423540125121. The next prime is 10423540125143. The reversal of 10423540125141 is 14152104532401.
It is not a de Polignac number, because 10423540125141 - 215 = 10423540092373 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10423540125143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 282508255 + ... + 282545148.
It is an arithmetic number, because the mean of its divisors is an integer number (522109345296).
Almost surely, 210423540125141 is an apocalyptic number.
10423540125141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10423540125141 is a deficient number, since it is larger than the sum of its proper divisors (6283958924331).
10423540125141 is a wasteful number, since it uses less digits than its factorization.
10423540125141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 565053473.
The product of its (nonzero) digits is 19200, while the sum is 33.
Adding to 10423540125141 its reverse (14152104532401), we get a palindrome (24575644657542).
The spelling of 10423540125141 in words is "ten trillion, four hundred twenty-three billion, five hundred forty million, one hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •