Base | Representation |
---|---|
bin | 110010101101110100011… |
… | …1110011010111000000000 |
3 | 220200100200101000221220220 |
4 | 1211123220332122320000 |
5 | 1403200231440144412 |
6 | 22454044345303040 |
7 | 1316406443201454 |
oct | 145335076327000 |
9 | 26610611027826 |
10 | 6970345631232 |
11 | 224811a435165 |
12 | 946a96794a80 |
13 | 3b73baa4a069 |
14 | 1a151ba7c664 |
15 | c14ac0e968c |
hex | 656e8f9ae00 |
6970345631232 has 160 divisors (see below), whose sum is σ = 19174622269440. Its totient is φ = 2247774658560.
The previous prime is 6970345631209. The next prime is 6970345631257. The reversal of 6970345631232 is 2321365430796.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 159158394 + ... + 159202182.
It is an arithmetic number, because the mean of its divisors is an integer number (119841389184).
Almost surely, 26970345631232 is an apocalyptic number.
6970345631232 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6970345631232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9587311134720).
6970345631232 is an abundant number, since it is smaller than the sum of its proper divisors (12204276638208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6970345631232 is a wasteful number, since it uses less digits than its factorization.
6970345631232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47184 (or 47168 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 51.
The spelling of 6970345631232 in words is "six trillion, nine hundred seventy billion, three hundred forty-five million, six hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •