Base | Representation |
---|---|
bin | 10100010100100001001… |
… | …011100010011010000000 |
3 | 11221111101222112222121000 |
4 | 110110201023202122000 |
5 | 140334332241400330 |
6 | 2545301301132000 |
7 | 202613421012354 |
oct | 24244113423200 |
9 | 4844358488530 |
10 | 1396421043840 |
11 | 499245302589 |
12 | 1a67766ba000 |
13 | a18b32b4334 |
14 | 4b831177464 |
15 | 264cdd58560 |
hex | 145212e2680 |
1396421043840 has 256 divisors, whose sum is σ = 4981246704000. Its totient is φ = 369699323904.
The previous prime is 1396421043817. The next prime is 1396421043883. The reversal of 1396421043840 is 483401246931.
1396421043840 is a `hidden beast` number, since 1 + 396 + 4 + 210 + 4 + 3 + 8 + 40 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2111232 + ... + 2692608.
Almost surely, 21396421043840 is an apocalyptic number.
1396421043840 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 1396421043840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2490623352000).
1396421043840 is an abundant number, since it is smaller than the sum of its proper divisors (3584825660160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1396421043840 is a wasteful number, since it uses less digits than its factorization.
1396421043840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 581544 (or 581526 counting only the distinct ones).
The product of its (nonzero) digits is 497664, while the sum is 45.
The spelling of 1396421043840 in words is "one trillion, three hundred ninety-six billion, four hundred twenty-one million, forty-three thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •