Base | Representation |
---|---|
bin | 1001100011010000110111… |
… | …1010111010001101101001 |
3 | 1101011221000121120121201100 |
4 | 2120310031322322031221 |
5 | 2334023411204212241 |
6 | 34200142323512013 |
7 | 2132463122113512 |
oct | 230641572721551 |
9 | 41157017517640 |
10 | 10501428585321 |
11 | 33896a3734843 |
12 | 12172b7228609 |
13 | 5b2385252b4b |
14 | 2843b3d85a09 |
15 | 1332761b59b6 |
hex | 98d0deba369 |
10501428585321 has 24 divisors (see below), whose sum is σ = 15285802163840. Its totient is φ = 6947020080000.
The previous prime is 10501428585313. The next prime is 10501428585359. The reversal of 10501428585321 is 12358582410501.
It is a happy number.
10501428585321 is a `hidden beast` number, since 1 + 0 + 5 + 0 + 1 + 42 + 8 + 585 + 3 + 21 = 666.
It is not a de Polignac number, because 10501428585321 - 23 = 10501428585313 is a prime.
It is a super-2 number, since 2×105014285853212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10501428585421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2955280 + ... + 5453121.
Almost surely, 210501428585321 is an apocalyptic number.
It is an amenable number.
10501428585321 is a deficient number, since it is larger than the sum of its proper divisors (4784373578519).
10501428585321 is a wasteful number, since it uses less digits than its factorization.
10501428585321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8409477 (or 8409474 counting only the distinct ones).
The product of its (nonzero) digits is 384000, while the sum is 45.
The spelling of 10501428585321 in words is "ten trillion, five hundred one billion, four hundred twenty-eight million, five hundred eighty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •