Base | Representation |
---|---|
bin | 1001001000101000101011… |
… | …0001000101101010010100 |
3 | 1022120012012221212002001210 |
4 | 2102022022301011222110 |
5 | 2304030013141141400 |
6 | 33210044324021420 |
7 | 2054436506325342 |
oct | 222121261055224 |
9 | 38505187762053 |
10 | 10043961662100 |
11 | 3222690570473 |
12 | 1162706531870 |
13 | 57b1abbc8332 |
14 | 26a1b7910992 |
15 | 1263ee62a950 |
hex | 9228ac45a94 |
10043961662100 has 288 divisors, whose sum is σ = 30266194395136. Its totient is φ = 2569560537600.
The previous prime is 10043961662057. The next prime is 10043961662123. The reversal of 10043961662100 is 126616934001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 229759245 + ... + 229802955.
Almost surely, 210043961662100 is an apocalyptic number.
10043961662100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10043961662100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15133097197568).
10043961662100 is an abundant number, since it is smaller than the sum of its proper divisors (20222232733036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10043961662100 is a wasteful number, since it uses less digits than its factorization.
10043961662100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44055 (or 44048 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 39.
The spelling of 10043961662100 in words is "ten trillion, forty-three billion, nine hundred sixty-one million, six hundred sixty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •