Base | Representation |
---|---|
bin | 11110011000100010110… |
… | …01001011000110111100 |
3 | 10200210122222121011211102 |
4 | 33030101121023012330 |
5 | 114101022012132300 |
6 | 2115332003512232 |
7 | 135265343635646 |
oct | 17142131130674 |
9 | 3623588534742 |
10 | 1043968864700 |
11 | 372821231803 |
12 | 14a3b3088678 |
13 | 775a468ab48 |
14 | 38757b81896 |
15 | 1c2518c30d5 |
hex | f31164b1bc |
1043968864700 has 18 divisors (see below), whose sum is σ = 2265412436616. Its totient is φ = 417587545840.
The previous prime is 1043968864691. The next prime is 1043968864709. The reversal of 1043968864700 is 74688693401.
1043968864700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1043968864691) and next prime (1043968864709).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1043968864709) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5219844224 + ... + 5219844423.
Almost surely, 21043968864700 is an apocalyptic number.
1043968864700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1043968864700 is an abundant number, since it is smaller than the sum of its proper divisors (1221443571916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043968864700 is a wasteful number, since it uses less digits than its factorization.
1043968864700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10439688661 (or 10439688654 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 56.
The spelling of 1043968864700 in words is "one trillion, forty-three billion, nine hundred sixty-eight million, eight hundred sixty-four thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •