Base | Representation |
---|---|
bin | 110010001010000101011… |
… | …1001110101101100010111 |
3 | 220102000121012211112220001 |
4 | 1210110022321311230113 |
5 | 1400421100443210000 |
6 | 22354513440552131 |
7 | 1311021653315326 |
oct | 144241271655427 |
9 | 26360535745801 |
10 | 6893605444375 |
11 | 221861a614a31 |
12 | 93403a622647 |
13 | 3b00ab096980 |
14 | 19b91bc1c0bd |
15 | be4b9de146a |
hex | 6450ae75b17 |
6893605444375 has 40 divisors (see below), whose sum is σ = 9278099495280. Its totient is φ = 5089995456000.
The previous prime is 6893605444367. The next prime is 6893605444393. The reversal of 6893605444375 is 5734445063986.
6893605444375 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 6893605444375 - 23 = 6893605444367 is a prime.
It is a Smith number, since the sum of its digits (64) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 66922911 + ... + 67025839.
It is an arithmetic number, because the mean of its divisors is an integer number (231952487382).
Almost surely, 26893605444375 is an apocalyptic number.
6893605444375 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
6893605444375 is a deficient number, since it is larger than the sum of its proper divisors (2384494050905).
6893605444375 is a wasteful number, since it uses less digits than its factorization.
6893605444375 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111205 (or 111190 counting only the distinct ones).
The product of its (nonzero) digits is 261273600, while the sum is 64.
The spelling of 6893605444375 in words is "six trillion, eight hundred ninety-three billion, six hundred five million, four hundred forty-four thousand, three hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •