Base | Representation |
---|---|
bin | 1001100011001111101001… |
… | …0101011101001100111101 |
3 | 1101011220011201021202110220 |
4 | 2120303322111131030331 |
5 | 2334022223100000221 |
6 | 34200045545051553 |
7 | 2132452022150136 |
oct | 230637225351475 |
9 | 41156151252426 |
10 | 10501100000061 |
11 | 3389545206880 |
12 | 1217225186bb9 |
13 | 5b2332156cb8 |
14 | 284382490c8d |
15 | 13325740c0c6 |
hex | 98cfa55d33d |
10501100000061 has 16 divisors (see below), whose sum is σ = 15274536271680. Its totient is φ = 6364215947520.
The previous prime is 10501100000059. The next prime is 10501100000071. The reversal of 10501100000061 is 16000000110501.
It is not a de Polignac number, because 10501100000061 - 21 = 10501100000059 is a prime.
It is a super-2 number, since 2×105011000000612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10501100000071) 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, 313755 + ... + 4593543.
It is an arithmetic number, because the mean of its divisors is an integer number (954658516980).
Almost surely, 210501100000061 is an apocalyptic number.
10501100000061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10501100000061 is a deficient number, since it is larger than the sum of its proper divisors (4773436271619).
10501100000061 is a wasteful number, since it uses less digits than its factorization.
10501100000061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4354156.
The product of its (nonzero) digits is 30, while the sum is 15.
Adding to 10501100000061 its reverse (16000000110501), we get a palindrome (26501100110562).
The spelling of 10501100000061 in words is "ten trillion, five hundred one billion, one hundred million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •