Base | Representation |
---|---|
bin | 1001010100110011100110… |
… | …1001001000111011001011 |
3 | 1100022011220222000110121111 |
4 | 2111030321221020323023 |
5 | 2320441223312140243 |
6 | 33450104334551151 |
7 | 2105521144133311 |
oct | 225147151107313 |
9 | 40264828013544 |
10 | 10253054021323 |
11 | 32a3328775733 |
12 | 119713b0684b7 |
13 | 594b21b64509 |
14 | 2763713aa0b1 |
15 | 12ba8ae2239d |
hex | 95339a48ecb |
10253054021323 has 8 divisors (see below), whose sum is σ = 10265733713088. Its totient is φ = 10240375876224.
The previous prime is 10253054021299. The next prime is 10253054021381. The reversal of 10253054021323 is 32312045035201.
10253054021323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10253054021323 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10253054021393) 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, 13173315 + ... + 13929907.
It is an arithmetic number, because the mean of its divisors is an integer number (1283216714136).
Almost surely, 210253054021323 is an apocalyptic number.
10253054021323 is a deficient number, since it is larger than the sum of its proper divisors (12679691765).
10253054021323 is an equidigital number, since it uses as much as digits as its factorization.
10253054021323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 773333.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 10253054021323 its reverse (32312045035201), we get a palindrome (42565099056524).
The spelling of 10253054021323 in words is "ten trillion, two hundred fifty-three billion, fifty-four million, twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •