Base | Representation |
---|---|
bin | 1001000110010000111… |
… | …10010111011111010000 |
3 | 1002212212201000122101010 |
4 | 10203020132113133100 |
5 | 20110201332032130 |
6 | 355335033210520 |
7 | 31404355034550 |
oct | 4431036273720 |
9 | 1085781018333 |
10 | 312601049040 |
11 | 110634162a15 |
12 | 50701560a40 |
13 | 2362a668647 |
14 | 111b68db160 |
15 | 81e8aa80b0 |
hex | 48c87977d0 |
312601049040 has 160 divisors (see below), whose sum is σ = 1113903634176. Its totient is φ = 71038586880.
The previous prime is 312601049027. The next prime is 312601049063. The reversal of 312601049040 is 40940106213.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 312601048989 and 312601049007.
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 31 ways as a sum of consecutive naturals, for example, 247141 + ... + 828420.
Almost surely, 2312601049040 is an apocalyptic number.
312601049040 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
312601049040 is an abundant number, since it is smaller than the sum of its proper divisors (801302585136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312601049040 is a wasteful number, since it uses less digits than its factorization.
312601049040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1075757 (or 1075751 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 30.
The spelling of 312601049040 in words is "three hundred twelve billion, six hundred one million, forty-nine thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •