Base | Representation |
---|---|
bin | 1001010011000101100000… |
… | …1011011000010011100111 |
3 | 1100012100122101211000001122 |
4 | 2110301120023120103213 |
5 | 2320000212343331011 |
6 | 33424340050444155 |
7 | 2103423620201306 |
oct | 224613013302347 |
9 | 40170571730048 |
10 | 10223501542631 |
11 | 3291843105023 |
12 | 1191471b9365b |
13 | 5920c240bb30 |
14 | 274b6a57643d |
15 | 12ae0b7473db |
hex | 94c582d84e7 |
10223501542631 has 8 divisors (see below), whose sum is σ = 11009950963200. Its totient is φ = 9437055868512.
The previous prime is 10223501542607. The next prime is 10223501542687. The reversal of 10223501542631 is 13624510532201.
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 10223501542631 - 226 = 10223434433767 is a prime.
It is a super-2 number, since 2×102235015426312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10223501542591 and 10223501542600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10223501542691) 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, 7639445 + ... + 8877393.
It is an arithmetic number, because the mean of its divisors is an integer number (1376243870400).
Almost surely, 210223501542631 is an apocalyptic number.
10223501542631 is a deficient number, since it is larger than the sum of its proper divisors (786449420569).
10223501542631 is a wasteful number, since it uses less digits than its factorization.
10223501542631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1873225.
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 10223501542631 in words is "ten trillion, two hundred twenty-three billion, five hundred one million, five hundred forty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •