Base | Representation |
---|---|
bin | 101011101110110000… |
… | …0000101111101000000 |
3 | 22222101210011020020021 |
4 | 1113131200011331000 |
5 | 3014312041202234 |
6 | 111050351423224 |
7 | 6533122000534 |
oct | 1273540057500 |
9 | 288353136207 |
10 | 93910490944 |
11 | 36911029896 |
12 | 1624a524b14 |
13 | 8b1803434a |
14 | 478c3d1bc4 |
15 | 26998209b4 |
hex | 15dd805f40 |
93910490944 has 28 divisors (see below), whose sum is σ = 190318607424. Its totient is φ = 45956196224.
The previous prime is 93910490909. The next prime is 93910490957. The reversal of 93910490944 is 44909401939.
It is a super-2 number, since 2×939104909442 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 93910490891 and 93910490900.
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 3 ways as a sum of consecutive naturals, for example, 15607114 + ... + 15613129.
Almost surely, 293910490944 is an apocalyptic number.
93910490944 is a gapful number since it is divisible by the number (94) formed by its first and last digit.
It is an amenable number.
93910490944 is an abundant number, since it is smaller than the sum of its proper divisors (96408116480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
93910490944 is a wasteful number, since it uses less digits than its factorization.
93910490944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31220302 (or 31220292 counting only the distinct ones).
The product of its (nonzero) digits is 1259712, while the sum is 52.
The spelling of 93910490944 in words is "ninety-three billion, nine hundred ten million, four hundred ninety thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •