Base | Representation |
---|---|
bin | 10010110110000010001… |
… | …010110110100000110100 |
3 | 11120210112121201011000120 |
4 | 102312002022312200310 |
5 | 132204044033221100 |
6 | 2430522304411540 |
7 | 162362353133325 |
oct | 22660212664064 |
9 | 4523477634016 |
10 | 1294969038900 |
11 | 45a2142986a9 |
12 | 18ab82616bb0 |
13 | 95165a18294 |
14 | 4696934844c |
15 | 23a424050a0 |
hex | 12d822b6834 |
1294969038900 has 72 divisors (see below), whose sum is σ = 3771590311104. Its totient is φ = 343038144000.
The previous prime is 1294969038889. The next prime is 1294969038907. The reversal of 1294969038900 is 98309694921.
It is a super-3 number, since 3×12949690389003 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1294969038907) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 14247957 + ... + 14338556.
Almost surely, 21294969038900 is an apocalyptic number.
1294969038900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1294969038900 is an abundant number, since it is smaller than the sum of its proper divisors (2476621272204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1294969038900 is a wasteful number, since it uses less digits than its factorization.
1294969038900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28586681 (or 28586674 counting only the distinct ones).
The product of its (nonzero) digits is 7558272, while the sum is 60.
The spelling of 1294969038900 in words is "one trillion, two hundred ninety-four billion, nine hundred sixty-nine million, thirty-eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •