Base | Representation |
---|---|
bin | 1011100010101000000110… |
… | …0100111110110111000100 |
3 | 1122221002211120210112210020 |
4 | 2320222001210332313010 |
5 | 3130401102340113113 |
6 | 42553251301255140 |
7 | 2446533551532426 |
oct | 270520144766704 |
9 | 48832746715706 |
10 | 12689507347908 |
11 | 40526540a06a6 |
12 | 150b38a4044b0 |
13 | 71080008a941 |
14 | 31c26555c816 |
15 | 17013ac54023 |
hex | b8a8193edc4 |
12689507347908 has 24 divisors (see below), whose sum is σ = 29615362338912. Its totient is φ = 4228905516864.
The previous prime is 12689507347901. The next prime is 12689507347921. The reversal of 12689507347908 is 80974370598621.
It is a super-2 number, since 2×126895073479082 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12689507347901) 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, 116226385 + ... + 116335512.
It is an arithmetic number, because the mean of its divisors is an integer number (1233973430788).
It is a 2-persistent number, because it is pandigital, and so is 2⋅12689507347908 = 25379014695816, but 3⋅12689507347908 = 38068522043724 is not.
Almost surely, 212689507347908 is an apocalyptic number.
It is an amenable number.
12689507347908 is an abundant number, since it is smaller than the sum of its proper divisors (16925854991004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12689507347908 is a wasteful number, since it uses less digits than its factorization.
12689507347908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232566451 (or 232566449 counting only the distinct ones).
The product of its (nonzero) digits is 182891520, while the sum is 69.
The spelling of 12689507347908 in words is "twelve trillion, six hundred eighty-nine billion, five hundred seven million, three hundred forty-seven thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •