Base | Representation |
---|---|
bin | 11101011001011011000… |
… | …11110101010011011010 |
3 | 10120120012022212222010202 |
4 | 32230231203311103122 |
5 | 113022121402321100 |
6 | 2052005231542202 |
7 | 132655523432555 |
oct | 16545543652332 |
9 | 3516168788122 |
10 | 1010081682650 |
11 | 35a411860327 |
12 | 14391638a962 |
13 | 74333b85231 |
14 | 36c6138d69c |
15 | 1b41b8ab7d5 |
hex | eb2d8f54da |
1010081682650 has 96 divisors (see below), whose sum is σ = 1956169440000. Its totient is φ = 387570839040.
The previous prime is 1010081682647. The next prime is 1010081682653. The reversal of 1010081682650 is 562861800101.
It is an interprime number because it is at equal distance from previous prime (1010081682647) and next prime (1010081682653).
It is a super-2 number, since 2×10100816826502 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1010081682653) 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 47 ways as a sum of consecutive naturals, for example, 233434787 + ... + 233439113.
It is an arithmetic number, because the mean of its divisors is an integer number (20376765000).
Almost surely, 21010081682650 is an apocalyptic number.
1010081682650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010081682650 is a deficient number, since it is larger than the sum of its proper divisors (946087757350).
1010081682650 is a wasteful number, since it uses less digits than its factorization.
1010081682650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5376 (or 5371 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 38.
The spelling of 1010081682650 in words is "one trillion, ten billion, eighty-one million, six hundred eighty-two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •