Base | Representation |
---|---|
bin | 1001101001000011110101… |
… | …1111110111101000101010 |
3 | 1101112110001200120000121210 |
4 | 2122100331133313220222 |
5 | 2342141332312113200 |
6 | 34314012013413550 |
7 | 2142616636111110 |
oct | 232207537675052 |
9 | 41473050500553 |
10 | 10601011051050 |
11 | 34179554091a2 |
12 | 123266919a2b6 |
13 | 5bb8953c1c94 |
14 | 28913d799ab0 |
15 | 135b53926650 |
hex | 9a43d7f7a2a |
10601011051050 has 96 divisors (see below), whose sum is σ = 30047405985792. Its totient is φ = 2422998578880.
The previous prime is 10601011051009. The next prime is 10601011051087. The reversal of 10601011051050 is 5015011010601.
It is a happy number.
It is a super-2 number, since 2×106010110510502 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 30621219 + ... + 30965481.
It is an arithmetic number, because the mean of its divisors is an integer number (312993812352).
Almost surely, 210601011051050 is an apocalyptic number.
10601011051050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10601011051050 is an abundant number, since it is smaller than the sum of its proper divisors (19446394934742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10601011051050 is a wasteful number, since it uses less digits than its factorization.
10601011051050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373612 (or 373607 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 10601011051050 its reverse (5015011010601), we get a palindrome (15616022061651).
The spelling of 10601011051050 in words is "ten trillion, six hundred one billion, eleven million, fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •