Base | Representation |
---|---|
bin | 1011100010111110001100… |
… | …0010111011101010010000 |
3 | 1122221200010212112100110121 |
4 | 2320233203002323222100 |
5 | 3131000224003300433 |
6 | 43000111542240024 |
7 | 2450133530503060 |
oct | 270574302735220 |
9 | 48850125470417 |
10 | 12695437556368 |
11 | 4055117593026 |
12 | 1510564426014 |
13 | 71123685ba28 |
14 | 31c668da13a0 |
15 | 1703866a2c2d |
hex | b8be30bba90 |
12695437556368 has 40 divisors (see below), whose sum is σ = 28796968126080. Its totient is φ = 5308196885760.
The previous prime is 12695437556339. The next prime is 12695437556371. The reversal of 12695437556368 is 86365573459621.
12695437556368 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×126954375563682 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12695437556297 and 12695437556306.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1382338348 + ... + 1382347531.
It is an arithmetic number, because the mean of its divisors is an integer number (719924203152).
Almost surely, 212695437556368 is an apocalyptic number.
It is an amenable number.
12695437556368 is an abundant number, since it is smaller than the sum of its proper divisors (16101530569712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12695437556368 is a wasteful number, since it uses less digits than its factorization.
12695437556368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2764685935 (or 2764685929 counting only the distinct ones).
The product of its digits is 979776000, while the sum is 70.
The spelling of 12695437556368 in words is "twelve trillion, six hundred ninety-five billion, four hundred thirty-seven million, five hundred fifty-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •