Base | Representation |
---|---|
bin | 100111111111111… |
… | …1101100010100000 |
3 | 10110112112011021022 |
4 | 1033333331202200 |
5 | 10222043322300 |
6 | 341103145012 |
7 | 45155142623 |
oct | 11777754240 |
9 | 3415464238 |
10 | 1342167200 |
11 | 6296890a0 |
12 | 3155a5168 |
13 | 1850b009a |
14 | ca379dba |
15 | 7cc6e285 |
hex | 4fffd8a0 |
1342167200 has 72 divisors (see below), whose sum is σ = 3574458720. Its totient is φ = 488057600.
The previous prime is 1342167191. The next prime is 1342167247. The reversal of 1342167200 is 27612431.
It is a self number, because there is not a number n which added to its sum of digits gives 1342167200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 67460 + ... + 85059.
It is an arithmetic number, because the mean of its divisors is an integer number (49645260).
Almost surely, 21342167200 is an apocalyptic number.
1342167200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1342167200 is an abundant number, since it is smaller than the sum of its proper divisors (2232291520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1342167200 is a wasteful number, since it uses less digits than its factorization.
1342167200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152550 (or 152537 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 1342167200 is about 36635.6001725098. The cubic root of 1342167200 is about 1103.0677998680.
Adding to 1342167200 its reverse (27612431), we get a palindrome (1369779631).
The spelling of 1342167200 in words is "one billion, three hundred forty-two million, one hundred sixty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •