Base | Representation |
---|---|
bin | 1001001110110100001110… |
… | …0000001100000101010111 |
3 | 1022221100021201120021212120 |
4 | 2103231003200030011113 |
5 | 2312244441344411043 |
6 | 33330524323151023 |
7 | 2065215636303261 |
oct | 223550340140527 |
9 | 38840251507776 |
10 | 10150140232023 |
11 | 3263717602600 |
12 | 117b1b9515473 |
13 | 5882007967bc |
14 | 2713ab384b31 |
15 | 129065ec2983 |
hex | 93b4380c157 |
10150140232023 has 192 divisors, whose sum is σ = 16240947327360. Its totient is φ = 5620285440000.
The previous prime is 10150140232003. The next prime is 10150140232039. The reversal of 10150140232023 is 32023204105101.
It is a de Polignac number, because none of the positive numbers 2k-10150140232023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10150140231984 and 10150140232002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10150140232003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 6339874423 + ... + 6339876023.
It is an arithmetic number, because the mean of its divisors is an integer number (84588267330).
Almost surely, 210150140232023 is an apocalyptic number.
10150140232023 is a deficient number, since it is larger than the sum of its proper divisors (6090807095337).
10150140232023 is a wasteful number, since it uses less digits than its factorization.
10150140232023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2130 (or 2119 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 10150140232023 its reverse (32023204105101), we get a palindrome (42173344337124).
The spelling of 10150140232023 in words is "ten trillion, one hundred fifty billion, one hundred forty million, two hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •