Base | Representation |
---|---|
bin | 11110010111100001100… |
… | …00101110011001000000 |
3 | 10200202020211102121021111 |
4 | 33023300300232121000 |
5 | 114043411333443100 |
6 | 2115201405333104 |
7 | 135245645323654 |
oct | 17136060563100 |
9 | 3622224377244 |
10 | 1043421390400 |
11 | 37257019a204 |
12 | 14a27b867194 |
13 | 7751812315c |
14 | 3870518ca64 |
15 | 1c21d7cd6ba |
hex | f2f0c2e640 |
1043421390400 has 63 divisors (see below), whose sum is σ = 2567569301859. Its totient is φ = 417352212480.
The previous prime is 1043421390397. The next prime is 1043421390409. The reversal of 1043421390400 is 40931243401.
The square root of 1043421390400 is 1021480.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 191654830656 + 851766559744 = 437784^2 + 922912^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1043421390409) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 40846432 + ... + 40871968.
Almost surely, 21043421390400 is an apocalyptic number.
1043421390400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1043421390400 is the 1021480-th square number.
It is an amenable number.
1043421390400 is an abundant number, since it is smaller than the sum of its proper divisors (1524147911459).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043421390400 is an frugal number, since it uses more digits than its factorization.
1043421390400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51096 (or 25544 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 1043421390400 in words is "one trillion, forty-three billion, four hundred twenty-one million, three hundred ninety thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •