Base | Representation |
---|---|
bin | 1000010001010011010… |
… | …0010100000000000000 |
3 | 111120202000120022102022 |
4 | 2010110310110000000 |
5 | 4311441243202441 |
6 | 145134435341012 |
7 | 13156645043000 |
oct | 2042464240000 |
9 | 446660508368 |
10 | 142083178496 |
11 | 55291282a66 |
12 | 23653451768 |
13 | 105243403ac |
14 | 6c3c17a000 |
15 | 3a68a6484b |
hex | 2114d14000 |
142083178496 has 240 divisors, whose sum is σ = 335638934400. Its totient is φ = 60114862080.
The previous prime is 142083178483. The next prime is 142083178577. The reversal of 142083178496 is 694871380241.
It is a super-2 number, since 2×1420831784962 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 736182176 + ... + 736182368.
It is an arithmetic number, because the mean of its divisors is an integer number (1398495560).
Almost surely, 2142083178496 is an apocalyptic number.
142083178496 is a gapful number since it is divisible by the number (16) 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 142083178496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167819467200).
142083178496 is an abundant number, since it is smaller than the sum of its proper divisors (193555755904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142083178496 is an frugal number, since it uses more digits than its factorization.
142083178496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373 (or 333 counting only the distinct ones).
The product of its (nonzero) digits is 2322432, while the sum is 53.
The spelling of 142083178496 in words is "one hundred forty-two billion, eighty-three million, one hundred seventy-eight thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •