Base | Representation |
---|---|
bin | 1011100000110110101010… |
… | …0100001001101010011111 |
3 | 1122211012020102010022222220 |
4 | 2320031222210021222133 |
5 | 3124401221424423400 |
6 | 42531253521440423 |
7 | 2444405135462520 |
oct | 270155244115237 |
9 | 48735212108886 |
10 | 12659056482975 |
11 | 4040748400121 |
12 | 15054b04a0113 |
13 | 70a989485276 |
14 | 31a9b72ac847 |
15 | 16e45776a7a0 |
hex | b836a909a9f |
12659056482975 has 48 divisors (see below), whose sum is σ = 23920267671552. Its totient is φ = 5786832965760.
The previous prime is 12659056482887. The next prime is 12659056483057. The reversal of 12659056482975 is 57928465095621.
12659056482975 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12659056482975 - 215 = 12659056450207 is a prime.
It is a super-2 number, since 2×126590564829752 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 19234194 + ... + 19881456.
It is an arithmetic number, because the mean of its divisors is an integer number (498338909824).
Almost surely, 212659056482975 is an apocalyptic number.
12659056482975 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12659056482975 is a deficient number, since it is larger than the sum of its proper divisors (11261211188577).
12659056482975 is a wasteful number, since it uses less digits than its factorization.
12659056482975 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 684536 (or 684531 counting only the distinct ones).
The product of its (nonzero) digits is 326592000, while the sum is 69.
The spelling of 12659056482975 in words is "twelve trillion, six hundred fifty-nine billion, fifty-six million, four hundred eighty-two thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •