Base | Representation |
---|---|
bin | 1001011110101100101101… |
… | …0010100111001101011111 |
3 | 1100220102120212211110002000 |
4 | 2113223023102213031133 |
5 | 2331232301314023033 |
6 | 34100132151133343 |
7 | 2124015455240235 |
oct | 227531322471537 |
9 | 40812525743060 |
10 | 10423001314143 |
11 | 3359408573150 |
12 | 120406a074253 |
13 | 5a7b66bc5c02 |
14 | 280694042955 |
15 | 1311d5d0aa13 |
hex | 97acb4a735f |
10423001314143 has 32 divisors (see below), whose sum is σ = 16848560736000. Its totient is φ = 6315730711200.
The previous prime is 10423001314123. The next prime is 10423001314147. The reversal of 10423001314143 is 34141310032401.
10423001314143 is a `hidden beast` number, since 1 + 0 + 4 + 2 + 300 + 1 + 314 + 1 + 43 = 666.
It is not a de Polignac number, because 10423001314143 - 25 = 10423001314111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10423001314147) 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, 1926888 + ... + 4955693.
It is an arithmetic number, because the mean of its divisors is an integer number (526517523000).
Almost surely, 210423001314143 is an apocalyptic number.
10423001314143 is a deficient number, since it is larger than the sum of its proper divisors (6425559421857).
10423001314143 is a wasteful number, since it uses less digits than its factorization.
10423001314143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6887700 (or 6887694 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 10423001314143 its reverse (34141310032401), we get a palindrome (44564311346544).
The spelling of 10423001314143 in words is "ten trillion, four hundred twenty-three billion, one million, three hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •