Base | Representation |
---|---|
bin | 10011001000001010001… |
… | …000100101001000110000 |
3 | 11122122202212222010010010 |
4 | 103020022020211020300 |
5 | 133013423040422000 |
6 | 2443501340534520 |
7 | 163651541526135 |
oct | 23101210451060 |
9 | 4578685863103 |
10 | 1314430014000 |
11 | 4674a05262a4 |
12 | 1928b3b51440 |
13 | 96c4782606c |
14 | 47893bda58c |
15 | 242d0b99d50 |
hex | 1320a225230 |
1314430014000 has 160 divisors (see below), whose sum is σ = 4240406828736. Its totient is φ = 350292633600.
The previous prime is 1314430013999. The next prime is 1314430014017. The reversal of 1314430014000 is 4100344131.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9513412 + ... + 9650588.
Almost surely, 21314430014000 is an apocalyptic number.
1314430014000 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 1314430014000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2120203414368).
1314430014000 is an abundant number, since it is smaller than the sum of its proper divisors (2925976814736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1314430014000 is a wasteful number, since it uses less digits than its factorization.
1314430014000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138800 (or 138784 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1314430014000 its reverse (4100344131), we get a palindrome (1318530358131).
The spelling of 1314430014000 in words is "one trillion, three hundred fourteen billion, four hundred thirty million, fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •