Base | Representation |
---|---|
bin | 11110010111100000011… |
… | …00111001110100000000 |
3 | 10200202020011202112001220 |
4 | 33023300030321310000 |
5 | 114043401433000000 |
6 | 2115200432155040 |
7 | 135245502443466 |
oct | 17136014716400 |
9 | 3622204675056 |
10 | 1043412000000 |
11 | 372565966047 |
12 | 14a278698a80 |
13 | 775161b5bc6 |
14 | 38703c26836 |
15 | 1c21ca761a0 |
hex | f2f0339d00 |
1043412000000 has 252 divisors, whose sum is σ = 3471242442528. Its totient is φ = 278240000000.
The previous prime is 1043411999999. The next prime is 1043412000017. The reversal of 1043412000000 is 2143401.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 11956525 + ... + 12043475.
Almost surely, 21043412000000 is an apocalyptic number.
1043412000000 is a gapful number since it is divisible by the number (10) 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 1043412000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1735621221264).
1043412000000 is an abundant number, since it is smaller than the sum of its proper divisors (2427830442528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043412000000 is an frugal number, since it uses more digits than its factorization.
1043412000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87000 (or 86961 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 1043412000000 its reverse (2143401), we get a palindrome (1043414143401).
The spelling of 1043412000000 in words is "one trillion, forty-three billion, four hundred twelve million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •