Base | Representation |
---|---|
bin | 1001001110100001001010… |
… | …0101010001000000010111 |
3 | 1022220212002012102210022110 |
4 | 2103220102211101000113 |
5 | 2312204002233341043 |
6 | 33324320535402103 |
7 | 2064645110351562 |
oct | 223502245210027 |
9 | 38825065383273 |
10 | 10145024512023 |
11 | 3261531947435 |
12 | 117a210223333 |
13 | 58789697c14b |
14 | 271043b9d4d9 |
15 | 128d66d0db33 |
hex | 93a12951017 |
10145024512023 has 4 divisors (see below), whose sum is σ = 13526699349368. Its totient is φ = 6763349674680.
The previous prime is 10145024512009. The next prime is 10145024512057. The reversal of 10145024512023 is 32021542054101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10145024512023 - 218 = 10145024249879 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 (10145024511023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1690837418668 + ... + 1690837418673.
It is an arithmetic number, because the mean of its divisors is an integer number (3381674837342).
Almost surely, 210145024512023 is an apocalyptic number.
10145024512023 is a deficient number, since it is larger than the sum of its proper divisors (3381674837345).
10145024512023 is an equidigital number, since it uses as much as digits as its factorization.
10145024512023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3381674837344.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 10145024512023 its reverse (32021542054101), we get a palindrome (42166566566124).
The spelling of 10145024512023 in words is "ten trillion, one hundred forty-five billion, twenty-four million, five hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •