Base | Representation |
---|---|
bin | 1001100011001111010001… |
… | …1010001000000101101000 |
3 | 1101011212220210011201201201 |
4 | 2120303310122020011220 |
5 | 2334022022120423000 |
6 | 34200032033453544 |
7 | 2132446404012265 |
oct | 230636432100550 |
9 | 41155823151651 |
10 | 10501000561000 |
11 | 33894a4068834 |
12 | 12171b7a112b4 |
13 | 5b231767b911 |
14 | 2843731a826c |
15 | 13324d81896a |
hex | 98cf4688168 |
10501000561000 has 64 divisors (see below), whose sum is σ = 24581158290000. Its totient is φ = 4198893049600.
The previous prime is 10501000560991. The next prime is 10501000561003. The reversal of 10501000561000 is 16500010501.
It can be written as a sum of positive squares in 8 ways, for example, as 34986206116 + 10466014354884 = 187046^2 + 3235122^2 .
It is a super-2 number, since 2×105010005610002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10501000561003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 906426 + ... + 4671574.
Almost surely, 210501000561000 is an apocalyptic number.
10501000561000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10501000561000 is an abundant number, since it is smaller than the sum of its proper divisors (14080157729000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10501000561000 is a wasteful number, since it uses less digits than its factorization.
10501000561000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3767959 (or 3767945 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 10501000561000 its reverse (16500010501), we get a palindrome (10517500571501).
The spelling of 10501000561000 in words is "ten trillion, five hundred one billion, five hundred sixty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •