Base | Representation |
---|---|
bin | 1001011110100101110000… |
… | …0101100100011101111111 |
3 | 1100220020202212012120102102 |
4 | 2113221130011210131333 |
5 | 2331214441204432223 |
6 | 34055223103015315 |
7 | 2123621312156453 |
oct | 227513405443577 |
9 | 40806685176372 |
10 | 10421135624063 |
11 | 335864042161a |
12 | 120382929a53b |
13 | 5a792a515c98 |
14 | 28055834a663 |
15 | 131127128928 |
hex | 97a5c16477f |
10421135624063 has 8 divisors (see below), whose sum is σ = 10691550579600. Its totient is φ = 10153846853248.
The previous prime is 10421135624047. The next prime is 10421135624071. The reversal of 10421135624063 is 36042653112401.
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 10421135624063 - 24 = 10421135624047 is a prime.
It is a super-2 number, since 2×104211356240632 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10421135624093) 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, 781539428 + ... + 781552761.
It is an arithmetic number, because the mean of its divisors is an integer number (1336443822450).
Almost surely, 210421135624063 is an apocalyptic number.
10421135624063 is a deficient number, since it is larger than the sum of its proper divisors (270414955537).
10421135624063 is a wasteful number, since it uses less digits than its factorization.
10421135624063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1563092361.
The product of its (nonzero) digits is 103680, while the sum is 38.
Adding to 10421135624063 its reverse (36042653112401), we get a palindrome (46463788736464).
The spelling of 10421135624063 in words is "ten trillion, four hundred twenty-one billion, one hundred thirty-five million, six hundred twenty-four thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •