Base | Representation |
---|---|
bin | 11101001000011000111… |
… | …01010100110001011100 |
3 | 10112200120222102011022122 |
4 | 32210030131110301130 |
5 | 112344404204100240 |
6 | 2043453540402112 |
7 | 132213064653116 |
oct | 16441435246134 |
9 | 3480528364278 |
10 | 1000936393820 |
11 | 356549555490 |
12 | 141ba36a6338 |
13 | 7350729551c |
14 | 366349583b6 |
15 | 1b083a814b5 |
hex | e90c754c5c |
1000936393820 has 48 divisors (see below), whose sum is σ = 2298028604256. Its totient is φ = 363187296000.
The previous prime is 1000936393819. The next prime is 1000936393841. The reversal of 1000936393820 is 283936390001.
It is a super-2 number, since 2×10009363938202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4833191 + ... + 5036030.
It is an arithmetic number, because the mean of its divisors is an integer number (47875595922).
Almost surely, 21000936393820 is an apocalyptic number.
1000936393820 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1000936393820 is an abundant number, since it is smaller than the sum of its proper divisors (1297092210436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000936393820 is a wasteful number, since it uses less digits than its factorization.
1000936393820 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9869702 (or 9869700 counting only the distinct ones).
The product of its (nonzero) digits is 209952, while the sum is 44.
The spelling of 1000936393820 in words is "one trillion, nine hundred thirty-six million, three hundred ninety-three thousand, eight hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •