Base | Representation |
---|---|
bin | 10011000000010110111… |
… | …110111110010000001100 |
3 | 11121212011021011002110011 |
4 | 103000112332332100030 |
5 | 132344300222232102 |
6 | 2435554345323004 |
7 | 163234163656354 |
oct | 23002676762014 |
9 | 4555137132404 |
10 | 1306055664652 |
11 | 463993412722 |
12 | 191157496464 |
13 | 96211882a6b |
14 | 472db927b64 |
15 | 23e908a62d7 |
hex | 13016fbe40c |
1306055664652 has 48 divisors (see below), whose sum is σ = 2389850724352. Its totient is φ = 623825504640.
The previous prime is 1306055664593. The next prime is 1306055664671. The reversal of 1306055664652 is 2564665506031.
It is a super-2 number, since 2×13060556646522 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1306055664596 and 1306055664605.
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, 3834283 + ... + 4160989.
Almost surely, 21306055664652 is an apocalyptic number.
It is an amenable number.
1306055664652 is a deficient number, since it is larger than the sum of its proper divisors (1083795059700).
1306055664652 is a wasteful number, since it uses less digits than its factorization.
1306055664652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327158 (or 327156 counting only the distinct ones).
The product of its (nonzero) digits is 3888000, while the sum is 49.
The spelling of 1306055664652 in words is "one trillion, three hundred six billion, fifty-five million, six hundred sixty-four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •