Base | Representation |
---|---|
bin | 1001000111011100010001… |
… | …0100111001100010001011 |
3 | 1022111020021122021102112102 |
4 | 2101313010110321202023 |
5 | 2303211012320430233 |
6 | 33152413245504015 |
7 | 2053112332415054 |
oct | 221670424714213 |
9 | 38436248242472 |
10 | 10023452514443 |
11 | 3214a166a7265 |
12 | 115a741b7200b |
13 | 579290bb49c4 |
14 | 2691cdb7172b |
15 | 125aedd3b1e8 |
hex | 91dc453988b |
10023452514443 has 8 divisors (see below), whose sum is σ = 10161146580768. Its totient is φ = 9885768894144.
The previous prime is 10023452514437. The next prime is 10023452514457. The reversal of 10023452514443 is 34441525432001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10023452514443 - 212 = 10023452510347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10023452514397 and 10023452514406.
It is not an unprimeable number, because it can be changed into a prime (10023152514443) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 669380 + ... + 4527137.
It is an arithmetic number, because the mean of its divisors is an integer number (1270143322596).
Almost surely, 210023452514443 is an apocalyptic number.
10023452514443 is a deficient number, since it is larger than the sum of its proper divisors (137694066325).
10023452514443 is an equidigital number, since it uses as much as digits as its factorization.
10023452514443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5223013.
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 10023452514443 its reverse (34441525432001), we get a palindrome (44464977946444).
The spelling of 10023452514443 in words is "ten trillion, twenty-three billion, four hundred fifty-two million, five hundred fourteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •