Base | Representation |
---|---|
bin | 10100101111110011001… |
… | …000111000101111000000 |
3 | 12001022000102020020012211 |
4 | 110233303020320233000 |
5 | 141324330110234000 |
6 | 3010544053231504 |
7 | 205001335450345 |
oct | 24576310705700 |
9 | 5038012206184 |
10 | 1425713368000 |
11 | 4aa707034249 |
12 | 1b0390632594 |
13 | a45a0b8031c |
14 | 4d00d60a7cc |
15 | 271457957ba |
hex | 14bf3238bc0 |
1425713368000 has 224 divisors, whose sum is σ = 3617113294080. Its totient is φ = 556501017600.
The previous prime is 1425713367959. The next prime is 1425713368003. The reversal of 1425713368000 is 8633175241.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425713368003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57339571 + ... + 57364429.
Almost surely, 21425713368000 is an apocalyptic number.
1425713368000 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 1425713368000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1808556647040).
1425713368000 is an abundant number, since it is smaller than the sum of its proper divisors (2191399926080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1425713368000 is a wasteful number, since it uses less digits than its factorization.
1425713368000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25060 (or 25040 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 1425713368000 in words is "one trillion, four hundred twenty-five billion, seven hundred thirteen million, three hundred sixty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •