Base | Representation |
---|---|
bin | 1011100011010110101111… |
… | …1111010100010111100011 |
3 | 1122222022011022110222022021 |
4 | 2320311223333110113203 |
5 | 3131102224143224013 |
6 | 43003122042322311 |
7 | 2450456101015261 |
oct | 270655377242743 |
9 | 48868138428267 |
10 | 12702030054883 |
11 | 405799a908804 |
12 | 15118a41b9397 |
13 | 711a475c7b20 |
14 | 31cad2763431 |
15 | 170620325a8d |
hex | b8d6bfd45e3 |
12702030054883 has 8 divisors (see below), whose sum is σ = 13689575344368. Its totient is φ = 11715979916064.
The previous prime is 12702030054881. The next prime is 12702030054919. The reversal of 12702030054883 is 38845003020721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12702030054883 - 21 = 12702030054881 is a prime.
It is a super-2 number, since 2×127020300548832 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12702030054881) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 373770016 + ... + 373803997.
It is an arithmetic number, because the mean of its divisors is an integer number (1711196918046).
Almost surely, 212702030054883 is an apocalyptic number.
12702030054883 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12702030054883 is a deficient number, since it is larger than the sum of its proper divisors (987545289485).
12702030054883 is a wasteful number, since it uses less digits than its factorization.
12702030054883 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747575333.
The product of its (nonzero) digits is 322560, while the sum is 43.
The spelling of 12702030054883 in words is "twelve trillion, seven hundred two billion, thirty million, fifty-four thousand, eight hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •